Efficient Single-Pass Index Construction for Text Databases

Efficient Single-Pass Index Construction for Text Databases (2003)

Cached

Download Links

[www.cs.rmit.edu.au]
[www.seg.rmit.edu.au]

Other Repositories/Bibliography

DBLP

by Steffen Heinz , Justin Zobel

Venue:	Jour. of the American Society for Information Science and Technology
Citations:	31 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Single-Pass Index Construction for Text Databases	user correction - Legacy Corrections
AUTHOR NAME	Steffen Heinz	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science and Information Technology, RMIT University; GPO Box 2476V, Melbourne 3001	SVM HeaderParse 0.2
AUTHOR ADDR	Australia	SVM HeaderParse 0.1
AUTHOR NAME	Justin Zobel	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science and Information Technology, RMIT University; GPO Box 2476V, Melbourne 3001	SVM HeaderParse 0.2
AUTHOR ADDR	Australia	SVM HeaderParse 0.1
ABSTRACT	Efficient construction of inverted indexes is essential to provision of search over large collections of text data. In this paper, we review the principal approaches to inversion, analyse their theoretical cost, and present experimental results. We identify the drawbacks of existing inversion approaches and propose a single-pass inversion method that, in contrast to previous approaches, does not require the complete vocabulary of the indexed collection in main memory, can operate within limited resources, and does not sacrifice speed with high temporary storage requirements. We show that the performance of the single-pass approach can be improved by constructing inverted files in segments, reducing the cost of disk accesses during inversion of large volumes of data.	SVM HeaderParse 0.1
YEAR	2003	INFERENCE
VENUE	Jour. of the American Society for Information Science and Technology	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2003	INFERENCE
VOLUME	54	INFERENCE
CITATIONS	22 found	ParsCit 1.0