Principles of database buffer management
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Term-weighting approaches in automatic text retrieval
Information Processing and Management: an International Journal
Data caching issues in an information retrieval system
ACM Transactions on Database Systems (TODS)
Flexible buffer allocation based on marginal gains
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Lexical analysis and stoplists
Information retrieval
Information retrieval
Caching and database scaling in distributed shared-nothing information retrieval systems
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Implementations of partial document ranking using inverted files
Information Processing and Management: an International Journal
Natural language vs. Boolean query evaluation: a comparison of retrieval performance
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Document filtering for fast ranking
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Fast evaluation of structured queries for information retrieval
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Query evaluation: strategies and optimizations
Information Processing and Management: an International Journal
Performance tradeoffs for client-server query processing
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Filtered document retrieval with frequency-sorted indexes
Journal of the American Society for Information Science
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Operating system support for database management
Communications of the ACM
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Proceedings of the Tenth International Conference on Data Engineering
An Efficient Indexing Technique for Full Text Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Adaptive Database Buffer Allocation Using Query Feedback
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Dual-Buffering Strategies in Object Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Reordering Query Execution in Tertiary Memory Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A framework for modeling buffer replacement strategies
Proceedings of the ninth international conference on Information and knowledge management
Rank-preserving two-level caching for scalable search engines
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the tenth international conference on Information and knowledge management
Predictive caching and prefetching of query results in search engines
WWW '03 Proceedings of the 12th international conference on World Wide Web
Three-level caching for efficient query processing in large Web search engines
WWW '05 Proceedings of the 14th international conference on World Wide Web
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Optimizing result prefetching in web search engines with segmented indices
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Just in time indexing for up to the second search
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
Improved techniques for result caching in web search engines
Proceedings of the 18th international conference on World wide web
A hybrid cache and prefetch mechanism for scientific literature search engines
ICWE'07 Proceedings of the 7th international conference on Web engineering
A refreshing perspective of search engine caching
Proceedings of the 19th international conference on World wide web
Engineering basic algorithms of an in-memory text search engine
ACM Transactions on Information Systems (TOIS)
A five-level static cache architecture for web search engines
Information Processing and Management: an International Journal
Hi-index | 0.00 |
The proliferation of the World Wide Web has brought information retrieval (IR) techniques to the forefront of search technology. To the average computer user, “searching” now means using IR-based systems for finding information on the WWW or in other document collections. IR query evaluation methods and workloads differ significantly from those found in database systems. In this paper, we focus on three such differences. First, due to the inherent fuzziness of the natural language used in IR queries and documents, an additional degree of flexibility is permitted in evaluating queries. Second, IR query evaluation algorithms tend to have access patterns that cause problems for traditional buffer replacement policies. Third, IR search is often an iterative process, in which a query is repeatedly refined and resubmitted by the user. Based on these differences, we develop two complementary techniques to improve the efficiency of IR queries: 1) Buffer-aware query evaluation, which alters the query evaluation process based on the current contents of buffers; and 2) Ranking-aware buffer replacement, which incorporates knowledge of the query processing strategy into replacement decisions. In a detailed performance study we show that using either of these techniques yields significant performance benefits and that in many cases, combining them produces even further improvements.