Multidimensional term indexing for efficient processing of complex queries

Kybernetika

Volumn 40, Issue 3, 2004, Pages 381-396

  Krátký, Michal ^a   Skopal, Tomáš ^a   Snášel, Václav ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

BUB forest; Complex queries; Multidimensional data structures; Term indexing

Indexed keywords

BOOLEAN ALGEBRA; DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION RETRIEVAL; XML;

BUB-FOREST; COMPLEX QUERIES; MULTIDIMENSIONAL DATA STRUCTURES; TERM INDEXING;

INDEXING (OF INFORMATION);

EID: 9744238097     PISSN: 00235954     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (23)

1. R. Baeza-Yates and B. Ribeiro-Neto: Modern Information Retrieval. Addison Wesley, New York 1999.
2. R. Bayer: The universal B-tree for multidimensional indexing: General concepts. In: Proc. World-Wide Computing and its Applications'97, WWCA'97, Tsukuba 1997.
3. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. 1990 ACM SIGMOD Internat. Conference on Management of Data, Atlantic City, NJ 1990, pp. 322-331.
4. C. Böhm, S. Berchtold, and D. A. Keim: Searching in high-dimensional spaces - Index structures for improving the performance of multimedia databases. ACM Comput. Surveys 33 (2001), 322-373.
5. M. Crochemore and W. Rytter: Text Algorithms. Oxford University Press, Oxford 1994.
6. U. Deppisch: S-tree: a dynamic balanced signature index for office retrieval. In: Proc. 9th ACM SIGIR Conference, Pisa 1986, pp. 77-87.
7. J. Dvorský, M. Krátký, T. Skopal, and V. Snášel: Term indexing in information retrieval systems. In: Proc. CIC'03, CSREA Press, Las Vegas 2003.
8. C. Faloutsos: Gray codes for partial match and range queries. IEEE Trans. Software Engrg. 14 (1988), 10, 1381-1393.
9. R. Fenk: The BUB-Tree. In: Proc. 28rd Internat, Conference on VLDB, Hongkong 2002.
10. R. Fenk, V. Markl, and R. Bayer: Improving multidimensional range queries of non rectangular volumes specified by a query box set. In: Proc. Internat. Symposium on Database, Web and Cooperative Systems (DWACOS), Baden-Baden 1999.
11. P. Ferragina and R. Grossi: A fully-dynamic data structure for external ubstring search. In: Proc. ACM Symposium on Theory of Computing, 1995.
12. A. Guttman: R-Trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD 1984, ACM Press, Boston 1984, pp. 47-57.
13. Y. Manolopoulos, Y. Theodoridis, and V. Tsotras: Advanced Database Indexing. Kluwer, Dordrecht 2001.
14. V. Markl: Mistral: Processing Relational Queries using a Multidimensional Access Technique. Ph.D. Thesis. Technical University Mïnchen 1999, http://mistral.in.tum.de/results/publications/Mar99.pdf.
15. NIST: Text REtrieval Conference (TREC). 2003, http://trec.nist.gov/.
16. F. Ramsak, V. Markl, R. Fenk, M. Zirkel, K. Elhardt, and R. Bayer: Integrating the UB-tree into a database system kernel. In: Proc. 26th VLDB Internat. Conference (Cairo 2000), Morgan Kaufmann, San Franciso, CA 2000.
17. S. Roman: Advanced Linear Algebra. Springer-Verlag, Berlin 1995.
18. G. Salton and M. J. McGill: Introduction to Modern Information Retrieval. First edition. McGraw Hill, New York 1983.
19. T. Skopal, M. Kráky, V. Snášel, and J. Pokorný: On Range Queries in Universal B-trees. Technical Report No. ARG-TR-01-2003, Department of Computer Science, VŠB-Technical University of Ostrava 2003, http://www.cs.vsb.cz/arg/techreports/range.pdf.
20. G. A. Stephen: String Searching Algorithms. Lecture Notes Series on Computing, World Scientific, 1998.
21. N. Wirth: Algorithms and Data Structures. Prentice Hall, Englewood Cliffs, N.J. 1984.
22. I. H. Witten, A. Moffat, and T. C. Bell: Managing Gigabytes, Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York 1994.
23. W3 Consortium: Extensible Markup Language (XML) 1.0. 1998, http://www.w3.org/TR/REC-xml.