Implementing ranking strategies using text signatures
ACM Transactions on Information Systems (TOIS)
A document retrieval system based on nearest neighbour searching
Journal of Information Science
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
Implementations of partial document ranking using inverted files
Information Processing and Management: an International Journal
Data compression in full-text retrieval systems
Journal of the American Society for Information Science
Document filtering for fast ranking
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Incremental updates of inverted lists for text document retrieval
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Information Processing and Management: an International Journal - Special issue: data compression
Adding compression to a full-text retrieval system
Software—Practice & Experience
Query evaluation: strategies and optimizations
Information Processing and Management: an International Journal
An experimental study of factors important in document ranking
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Optimization of inverted vector searches
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Efficient passage ranking for document databases
ACM Transactions on Information Systems (TOIS)
Relevance ranking for one to three term queries
Information Processing and Management: an International Journal
Main-memory index structures with fixed-size partial keys
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The nearest neighbour problem in information retrieval: an algorithm using upperbounds
SIGIR '81 Proceedings of the 4th annual international ACM SIGIR conference on Information storage and retrieval: theoretical issues in information retrieval
Modern Information Retrieval
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Introduction to Algorithms
Document Ranking and the Vector-Space Model
IEEE Software
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Efficient Indexing Technique for Full Text Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiency and effectiveness of query processing in cluster-based retrieval
Information Systems
Fundamentals of Database Systems, Fourth Edition
Fundamentals of Database Systems, Fourth Edition
Optimized query execution in large search engines with global page ordering
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient IR-style keyword search over relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Architecture of a grid-enabled Web search engine
Information Processing and Management: an International Journal
Incremental cluster-based retrieval using compressed cluster-skipping inverted files
ACM Transactions on Information Systems (TOIS)
Future Generation Computer Systems
Workload-aware indexing for keyword search in social networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Algorithms for within-cluster searches using inverted files
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Document replication strategies for geographically distributed web search engines
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11 alternative implementation techniques are presented under four different categories, and their asymptotic time and space complexities are investigated. To our knowledge, six of these techniques are not discussed in any other publication before. Furthermore, analytical experiments are carried out on a 30 GB document collection to evaluate the practical performance of different implementations in terms of query processing time and space consumption. Advantages and disadvantages of each technique are illustrated under different querying scenarios, and several experiments that investigate the scalability of the implementations are presented.