Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases

  • Yangjun Chen
  • Karl Aberer
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1677)

Abstract

In this paper, a new indexing technique to support the query evaluation in document databases is proposed. The key idea of the method is the combination of the technique of pat-trees with signature files. While the signature files are built to expedite the traversal of object hierarchies, the pat-trees are constructed to speed up both the signature file searching and the text scanning. In this way, high performance can be achieved.

Keywords

Query Evaluation Inverted Index Indexing Technique Query Signature Document Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ACCM96.
    S. Abiteboul, S. Cluet, V. Christophides, T. Milo, G. Moerkotte and J. Simeon, “Querying documents in object databases,” Int. J. on Digital Libraries, Vol. 1, No. 1, Jan. 1997, pp. 5–19.CrossRefGoogle Scholar
  2. ACM93.
    S. Abiteboul, S. Cluet and T. Milo, “Querying and Uodating the File,” Proc. of the 9th VLDB Conference, Dublin, Ireland, 1993, pp. 386–397.Google Scholar
  3. AHU74.
    Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Com., London, 1969.Google Scholar
  4. BA94.
    K. Böhm and K. Aberer, “Storing HyTime Documents in an Obeject-Oriented Databse,” Proc. of 3th Int. Conf. on Information and Knowledge Management, Gaithersburg, Maryland, ACM, Nov. 1994, pp. 26–33.CrossRefGoogle Scholar
  5. BDK92.
    F. Bancihon, C. Delobel and P. Kanellakis, “Building an Object-oriented Database System: The Story of O 2,” San Mateo, California, Morgan Kaufman, 1992.Google Scholar
  6. BANY97.
    K. Böhm, K. Aberer, E.J. Neuhold and X. Yang, “Structured Document Storage and Refined Declarative and NAvigational Access Mechanism in HyperStorm,” Int. J of VLDB, 1997.Google Scholar
  7. BU77.
    R. Bayer and K. Unterrauer, “Prefix B-tree,” ACMTransaction on Database Systems, 2(1), 11–26.Google Scholar
  8. CA98.
    Y. Chen, K. Aberer, Layered Index Structures in Document Database Systems, Proc. 7th Int. Conference on Information and Knowledge Management (CIKM), Bethesda, MD, USA: ACM, 1998, pp. 406–413.Google Scholar
  9. CF84.
    S. Christodoulakis and C. Faloutsos, “Design consideration for a message file server,” IEEE Trans. Software Engineering, 10(2) (1984) 201–210.CrossRefGoogle Scholar
  10. Cr86.
    D.A. Cruse, Lexical Semantics, Cambridge University Press, 1986.Google Scholar
  11. CR94.
    Crochemore, M. and Rytter, W., Text Algorithms. Oxford University Press, NewYork, 1994.Google Scholar
  12. CST92.
    W.B. Croft, L.A. Smith and H.R. Turtle, “ALoosely Coupled Integration of a Text Retrieval Systemand an Object Oriented Database,” Proc. of 15th Ann. Int. SIGIR, Denmark, June 1992.Google Scholar
  13. DaD88.
    C. Damier and B. Defude, “The Document Management Component of a Multimedia Data Model,” Proc. of 11th Int. Conf. on Research&Development in Information Retrieval, Grenoble, France, 1988, pp. 451–464.Google Scholar
  14. DD94.
    S.J. DeRose and D.D. Durand, “Making Hypermedia Work: A User’s Guide to Hy-Time,” Kluwer Academic Publishers, London, 1994.Google Scholar
  15. DGL98.
    A. Dessmark, O. Garrido and A. Lingas, “Comparison of signature file models with superimposed coding,” J. of Information Processing Letter 65 (1998) 101–106.CrossRefMathSciNetGoogle Scholar
  16. DWL92.
    S.C. Deerwester, K. Waclena and M. Lamar, “A Textual Object Management System,” Proc. of 15th Ann. Int. SIGIR, Denmark, 1992.Google Scholar
  17. EN89.
    R. Elmasri and S. B. Navathe, Fundamantals of Database Systems, Benjamin Cumming, California, 1989.Google Scholar
  18. Fa85.
    C. Faloutsos, “Access Methods for Text,” ACM Computing Surveys, 17(1), 1985, pp. 49–74.CrossRefGoogle Scholar
  19. Fa92.
    C. Faloutsos, “Signature Files,” in: Information Retrieval: Data Structures & Algorithms, edited by W.B. Frakes and R. Baeza-Yates, Prentice Hall, New Jersey, 1992, pp. 44–65.Google Scholar
  20. GBS92.
    G.H. Gonnet, R.A. Baeza-Yates, “New Indices for Text: Pat Trees and Pat Arrays,” in: Information Retrieval: Data Structures & Algorithms, edited by W.B. Frakes and R. Baeza-Yates, Prentice Hall, New Jersey, 1992, pp. 66–82.Google Scholar
  21. Hew92.
    Hewlett-Packard, OpenODB Reference Manual B3185A, 1992.Google Scholar
  22. HFBL92.
    D. Harman, E. Fox, R. and Baeza-Yates, “Inverted Files,” in: Information Retrieval: Data Structures & Algorithms, edited by W.B. Frakes and R. Baeza-Yates, Prentice Hall, New Jersey, 1992, pp. 28–43.Google Scholar
  23. Kn73.
    D.E. Knuth, The Art of Computer Programming: Sorting and Searching, Addison-Wesley Pub. London, 1973.Google Scholar
  24. LL92.
    W. Lee and D.L. Lee, “Signature File Methods for Indexing Object-Oriented Database Systems,” Proc. ICIC’92-2nd Int. Conf. on Data and Knowledge Engineering: Theory and Application, Hongkong, Dec. 1992, pp. 616–622.Google Scholar
  25. Ma90.
    I.A. Macleod, “Storage and Retrieval of Structured Documents,” J. of Information Processing & Management, Vol. 26, No. 2, 1990, pp. 197–208.CrossRefGoogle Scholar
  26. [Mo68]
    Morrison, D.R., PATRICIA-Practical Algorithm To Retrieve Information Coded in Alphanumeric. Journal of Association for Computing Machinary, Vol. 15, No. 4, Oct. 1968, pp. 514–534.MathSciNetGoogle Scholar
  27. Sch93.
    P. Schäuble, “SPIDER: A MultiMedia Forum-An Interactive Online Journal,” Proc. of Conf. on Electronic Publishing, John Wiley & Sons, Ltd, 1994, pp. 413–422.Google Scholar
  28. SM83.
    G. Salton and M.J. McGill, “Introduction to Modern Information Retrieval,” McGray-Hill Int. Book Com., Hamburg, 1983.MATHGoogle Scholar
  29. VAB96.
    M. Volz, K. Aberer and K. Böhm, “Applying a Flexible OODBMS-IRS_Coupling to Structured Document Handling,” Proc. of 12th Int. Conf. on Data Engineering, New Orleans, 1996, pp. 10–19.Google Scholar
  30. VML95.
    VODAK V 4.0 User Manual. Technical Report 910, GMD-IPSI, St. Augustin, April 1995.Google Scholar
  31. WMB94.
    I.H. Witten, A. Moffat and T.C. Bell, Managing Gigabytes, Van Nostrand Reinhold, 1992.Google Scholar
  32. YA94.
    T.W. Yan and J. Annevelink, “Integrating a Structural-Text Retrieval System with an Object-Oriented Database System,” Proc. of 20th VLDB Conf., Santiago, Chile, 1994, pp. 740–749.Google Scholar
  33. YLK94.
    H.S. Yong, S. Lee and H.J. Kim, “Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases,” Proc. of 10th Int. Conf. on Data Engineering, Houston, Texas, Feb. 1994, pp. 518–525.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Yangjun Chen
    • 1
  • Karl Aberer
    • 1
  1. 1.IPSI InstituteDarmstadtGermany

Personalised recommendations