A combination of trie-trees and inverted files for the indexing of set-valued attributes

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2006, Pages 728-737

  Terrovitis, Manolis ^a   Passas, Spyros ^a   Vassiliadis, Panos ^b   Sellis, Timos ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF IOANNINA   (Greece)

Author keywords

Containment queries; HTI; Inverted files; Tries

Indexed keywords

CONTAINMENT QUERIES; INVERTED FILES;

DATA MINING; DATA STRUCTURES; INDEXING (OF INFORMATION); QUERY PROCESSING;

TREES (MATHEMATICS);

EID: 34547622618     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183718     Document Type: Conference Paper

References (22)

1. R. A. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval. ACM Press / Addison-Wesley, 1999.
2. C. Faloutsos. Signature files. In Information Retrieval: Data Structures & Algorithms, pages 44-65. 1992.
3. A. Gionis, D. Gunopulos, and N. Koudas. Efficient and tunable similar set retrieval. In SIGMOD, 2001.
4. R. Goldman and J. Widom. Wsq/dsq: A practical approach for combined querying of databases and the web. In SIGMOD, 2000.
5. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation. In SIGMOD, 2000.
6. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53-87, 2004.
7. S. Helmer and G. Moerkotte. A performance study of four index structures for set-valued attributes of low cardinality. VLDBJ, 12(3):244 - 261, 2003.
8. S. Hettich and S. D. Bay. The UCI KDD Archive. University of California, Department of Information and Computer Science. 1999.
9. R. Kaushik, R. Krishnamurthy, J. F. Naughton, and R. Ramakrishnan. On the integration of structure indexes and inverted lists. In SIGMOD, 2004.
10. D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
11. N. Mamoulis. Efficient processing of joins on set-valued attributes. In SIGMOD, 2003.
12. N. Mamoulis, D. W. Cheung, and W. Lian. Similarity search in sets and categorical data using the signature tree. In ICDE, 2003.
13. S. Melnik and H. Garcia-Molina. Adaptive algorithms for set containment joins. ACM TODS, 28(1):56-99, 2003.
14. A. Moffat and J. Zobel. Self-indexing inverted files for fast text retrieval. ACM TOIS, 14(4):349-379, Oct. 1996.
15. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD, 2004.
16. F. Scholer, H. E. Williams, J. Yiannis, and J. Zobel. Compression of inverted indexes for fast query evaluation. In ACM SIGIR, Aug. 2002.
17. M. Stonebraker and D. Moore. Object-Relational DBMSs: The Next Great Wave. Morgan Kaufmann, 1996.
18. M. Terrovitis, S. Passas, P. Vassiliadis, and T. Sellis. HTI technical report, www.dblab.ece.ntua.gr/∼mter/papers/ TR-HTI-01.pdf, 2006.
19. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 2nd edition, 1999.
20. C. Zhang, J. F. Naughton, D. J. DeWitt, Q. Luo, and G. M. Lohman. On supporting containment queries in relational database management systems. In SIGMOD, 2001.
21. J. Zobel, A. Moffat, and K. Ramamohanarao. Inverted files versus signature files for text indexing. ACM TODS, 23(4):453-490, 1998.
22. J. Zobel, A. Moffat, and R. Sacks-Davis. An efficient indexing technique for full text databases. In VLDB, 1992.