[go: up one dir, main page]

Skobeltsyn et al., 2008 - Google Patents

ResIn: a combination of results caching and index pruning for high-performance web search engines

Skobeltsyn et al., 2008

View PDF
Document ID
14702249335500641160
Author
Skobeltsyn G
Junqueira F
Plachouras V
Baeza-Yates R
Publication year
Publication venue
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval

External Links

Snippet

Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit rate due to the large fraction of singleton queries, which is an important limitation. In this …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
    • G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30634—Querying
    • G06F17/30657—Query processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce, e.g. shopping or e-commerce

Similar Documents

Publication Publication Date Title
Skobeltsyn et al. ResIn: a combination of results caching and index pruning for high-performance web search engines
Baeza-Yates et al. The impact of caching on search engines
Fagni et al. Boosting the performance of web search engines: Caching and prefetching query results by exploiting historical usage data
Baeza-Yates et al. Design trade-offs for search engine caching
CN102542052B (en) Priority hash index
Cambazoglu et al. Scalability challenges in web search engines
US8631026B1 (en) Methods and systems for efficient query rewriting
US20100318538A1 (en) Predictive searching and associated cache management
US20080082554A1 (en) Systems and methods for providing a dynamic document index
US20100205213A1 (en) Non-exact cache matching
Alici et al. Timestamp-based result cache invalidation for web search engines
Anagnostopoulos et al. Stochastic query covering for fast approximate document retrieval
Altingovde et al. Static index pruning in web search engines: Combining term and document popularities with query views
Ceccarelli et al. Caching query-biased snippets for efficient retrieval
Cambazoglu et al. Query forwarding in geographically distributed search engines
Yafay et al. Caching scores for faster query processing with dynamic pruning in search engines
Altingovde et al. Second chance: A hybrid approach for dynamic result caching in search engines
CN101599069A (en) The searching method of electronic document and system
Ozcan et al. Second chance: A hybrid approach for dynamic result caching and prefetching in search engines
Falchi et al. Caching content-based queries for robust and efficient image retrieval
Tsegay et al. Dynamic index pruning for effective caching
Shokouhi et al. Updating collection representations for federated search
Feuerstein et al. Cost-aware intersection caching and processing strategies for in-memory inverted indexes
Altingovde et al. A cost-aware strategy for query result caching in web search engines
Puppin et al. Load-balancing and caching for collection selection architectures