Algebras for querying text regions: Expressive power and optimization

Journal of Computer and System Sciences

Volumn 57, Issue 3, 1998, Pages 272-288

  Consens, Mariano P ^a   Milo, Tova ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION RETRIEVAL SYSTEMS; OPTIMIZATION; POLYNOMIALS; TREES (MATHEMATICS);

REGION ALGEBRA; TEXT REGIONS;

QUERY LANGUAGES;

EID: 0032299213     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1564     Document Type: Article

References (27)

1. S. Abiteboul, S. Cluet, and T. Milo, Querying and updating the file, in "Proceedings of VLDB 93," pp. 73-84, 1993.
2. S. Abiteboul, S. Cluet, and T. Milo, A database interface for file update, in "Proceedings of SIGMOD 95," pp. 386-397, 1995.
3. R. Agrawal, C. Faloutsos, and A. Swami, Efficient similarity search in sequence databases, in "FODO," 1993.
4. S. Abiteboul, R. Hull, and V. Vianu, "Foundations of Databases," Addison-Wesley, Reading, MA, 1995.
5. G. E. Blake, M. P. Consens, P. Kilpeläinen, P.-Å. Larson, T. Snider, and F. W. Tompa, Text/relational database management systems; harmonizing SQL and SGML, in "Applications of Databases (Proceedings of the ADB'94 Conference)," pp. 267-280, Lectures Notes in Computer Science, No. 819, Springer-Verlag, Berlin/New York, 1994.
6. D. Barbara, H. Garcia-Molina, and S. Mehrota, The gold mailer, in "IEEE Data Eng.," pp. 92-99, 1993.
7. T. Berners-Lee, R. Cailliau, A. Luotonen, H. Frystyk Nielsen, and A. Secret, The world-wide web, Comm. Assoc. Comput. Mach. 37 (1994), 76-82.
8. F. J. Burkowski, An algebra for hierarchical organized text-dominated databases, Inform. Proc. Management 28 (1992), 333-348.
9. V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl, From structured documents to novel query facilities, in "Proceedings ACM SIGMOD," pp. 313-324, 1994.
10. C. L. A. Clarke, G. V. Cormack, and F. J. Burkowski, An algebra for structured text search and a framework for its implementation, Comput. J., to appear.
11. K. Compton and C. W. Henson, A uniform method for proving lower bounds on the complexity of logical theories, Ann. Pure Appl. Logic 48 (1990), 1-79.
12. M. Consens and T. Milo, Optimizing queries on files, in "Proceedings ACM SIGMOD," pp. 301-312, 1994.
13. E. Graedel, E. Boerger, and Y. Gurevich, "The Classical Decision Problem 1996," Perspectives in Mathematical Logic, Vol. 7, Springer-Verlag, Berlin/New York, 1996.
14. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961).
15. D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, Using collaborative filtering to weave an information tapestry, Comm. Assoc. Comput. Mach. 35 (1992).
16. G. Gonnet, Examples of PAT applied to the Oxford English Dictionary, Technical Report, OED-87-02 University of Waterloo, 1987.
17. G. Gonnet and F. Tompa, Mind your grammar: A new approach to modeling text, in "Proceedings of VLDB 87," pp. 339-346, 1987.
18. R. H. Guting, R. Zicari, and M. C. Choy, An algebra for structured office documents, ACM Trans. Office Inform. Systems 7 (1989), 123-157.
19. P. Kilpeläinen and H. Mannila, Retrieval from hierarchical texts by partial patterns, in "Proceedings of the 15th SIGIR Conference," 1993.
20. G. Navarro and R. Baeza-Yates, A language for queries on structure and contents of textual databases, in "Proceedings of the 18th SIGIR," 1995.
21. Open Text Corporation, "Open text 5 System Integration Guide and Database Administration Guide," 1995.
22. A. Paepcke, An object oriented view onto public heterogeneous text databases, in "IEEE Data Eng.," 484, 1993.
23. M. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1-35.
24. K. Shoens, A. Luniewski, P. Schwartz, J. Stamos, and J. Thomas, The Rufus system: Information organization for semi-structured data, in "Proceedings of VLDB 93," pp. 97-107, 1993.
25. A. Salminen and F. W. Tompa, PAT expressions: An algebra for text search, in "Papers in Computational Lexicography: COMPLEX'92," pp. 309-332, 1992.
26. W. Thomas, Automata on infinite objects, in "Handbook of Theoretical Computer Science, Vol. B," pp. 135-1991, 1990.
27. J. D. Ullman, "Database and Knowledge Base Systems," Comput. Sci. Press, New York, 1988.