Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
Access-Ordered Indexes
Garcia, S., Cannane, A. and Williams, H.E.
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 search- able document collection. Inverted indexes are highly optimised, and significant work has been undertaken over the past fifteen years to store, retrieve, com- press, and understand heuristics for these structures. In this paper, we propose a new self-organising in- verted index based on past queries. We show that this access-ordered index improves query evaluation speed by 25%-40% over a conventional, optimised approach with almost indistinguishable accuracy. We conclude that access-ordered indexes are a valuable new tool to support fast and accurate web search.
Cite as: Garcia, S., Cannane, A. and Williams, H.E. (2004). Access-Ordered Indexes. In Proc. Twenty-Seventh Australasian Computer Science Conference (ACSC2004), Dunedin, New Zealand. CRPIT, 26. Estivill-Castro, V., Ed. ACS. 7-14.
(from crpit.com)
(local if available)
