Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

Volumn , Issue , 2003, Pages 249-260

  Koch, Christoph ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIGITAL STORAGE; FORESTRY; QUERY LANGUAGES; SEARCH ENGINES; XML;

EXPERIMENTAL EVALUATION; FINITE STATE SYSTEMS; LARGE AMOUNTS OF DATA; QUERY ENGINES; QUERY PROCESSING TECHNIQUES; RUNNING TIME; SECONDARY STORAGE; TREE AUTOMATA;

TREES (MATHEMATICS);

EID: 84944268606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. S. Abiteboul and V. Vianu. "Regular Path Queries with Constraints". In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'97), Tucson, AZ USA, 1997.
3. M. Altinel and M. Franklin. "Efficient Filtering of XML Documents for Selective Dissemination of Information". In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB'00), pages 53-64, Cairo, Egypt, 2000.
4. A. Brüggemann-Klein, M. Murata, and D. Wood. "Regular Tree and Regular Hedge Languages over Non-ranked Alphabets: Version 1, April 3, 2001". Technical Report HKUST-TCSC-2001-05, Hong Kong University of Science and Technology, Hong Kong SAR, China, 2001.
5. A. Brüggemann-Klein and D. Wood. "Caterpillars: A Context Specification Technique". Markup Languages, 2(1):81-106, 2000.
6. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer-Verlag, Berlin, 1990.
7. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1999. Second edition.
8. M. Frick, M. Grohe, and C. Koch. "Query Evaluation on Compressed Trees". In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS), Ottawa, Canada, June 2003.
9. G. Gottlob and C. Koch. "Monadic Datalog and the Expressive Power of Web Information Extraction Languages", Nov. 2002. Journal version of PODS'02 paper, submitted. Available as CoRR report arXiv:cs. DB/0211020.
10. G. Gottlob, C. Koch, and R. Pichler. "Efficient Algorithms for Processing XPath Queries". In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02), Hong Kong, China, 2002.
11. G. Gottlob, C. Koch, and R. Pichler. "XPath Query Evaluation: Improving Time and Space Efficiency". In Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE'03), Bangalore, India, Mar. 2003.
12. T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. "Processing XML Streams with Deterministic Automata". In Proc. of the 9th International Conference on Database Theory (ICDT'03), 2003.
13. M. Minoux. "LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation". Information Processing Letters, 29(1):1-12, 1988.
14. F. Neven. "Design and Analysis of Query Languages for Structured Documents - A Formal and Logical Approach". PhD thesis, Limburgs Universitair Centrum, 1999.
15. F. Neven. "Automata Theory for XML Researchers". SIGMOD Record, 31(3), Sept. 2002.
16. F. Neven and T. Schwentick. "Query Automata on Finite Trees". Theoretical Computer Science, 275:633-674, 2002.
17. F. Neven and J. van den Bussche. "Expressiveness of Structured Document Query Languages Based on Attribute Grammars". J. ACM, 49(1):56-100, Jan. 2002.
18. W. Thomas. "Automata on Infinite Objects". In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 2, chapter 4, pages 133-192. Elsevier Science Publishers B. V., 1990.
19. World Wide Web Consortium. XML Path Language (XPath) Recommendation. http://www.w3c.org/TR/xpath/, Nov. 1999.