Access-Ordered Indexes

Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all practical search engines is supported by an inverted index structure that stores all search terms and their locations within the searchable document collection. Inverted indexes are highly optimised, and significant work has been undertaken over the past fifteen years to store, retrieve, compress, and understand heuristics for these structures. In this paper, we propose a new self-organising inverted index based on past queries. We show that this access-ordered index improves query evaluation speed by 25%

• Type: Conference
• Year: 2004
• Where: ACSC
• Authors: Steven Garcia, Hugh E. Williams, Adam Cannane
• Keywords: ACSC 2004, Inverted Index, Search Engines, Self-organising Inverted Index, Theoretical Computer Science