Generating relations from XML documents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2572, Issue , 2003, Pages 285-299

  Cohen, Sara ^a   Kanza, Yaron ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

EVALUATION ALGORITHM; GENERATING RELATIONS; INCOMPLETE INFORMATION; NULL VALUE; PATH EXPRESSIONS;

XML;

EID: 33745794066     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36285-1_19     Document Type: Article

References (15)

1. U. Chakravarthy and J. Minker. Multiple query processing in deductive databases using query graphs. In Proceedings of International Conference on Very Large Data Bases, pages 384-391. Morgan Kaufmann, 1986.
2. S. Cohen, Y. Kanza, and Y. Sagiv. SQL4X: A flexible query language for XML and relational databases. In Proc. of the 8th International Workshop on Database and Programming Languages (DBPL), pages 263-280, Marino, (Rome, Italy), September 2001. Springer-Verlag.
3. S. Cohen, Y. Kanza, and Y. Sagiv. Select project queries over xml documents. In Proc. 5th Workshop on Next Generation Information Technologies and Systems, pages 2-13, Caesarea (Israel), June 2002. Springer-Verlag.
4. M. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, and K. Shim. XTRACT: A system for extracting document type descriptors from xml documents. In Proc. 2000 ACM SIGMOD International Conference on Management of Data, pages 165-176, Dallas (Texas, USA), May 2000. ACM Press.
5. M. Graham. On the universal relation. Technical report, University of Toronto, Toronto (Canada), 1979.
6. A. Gupta, V. Harinarayan, and A. Rajaraman. Virtual database technology. In Proc. 14th International Conference on Data Engineering, pages 297-301, Orlando (Florida, USA), Feb. 1998. IEEE Computer Society.
7. Y. Kanza and S. Sagiv. Flexible queries over semistructured data. In Proc. 20th Symposium on Principles of Database Systems, pages 40-51, Santa Barbara (California, USA), May 2001. ACM Press.
8. D. Maier, J. D. Ullman, and M. Y. Vardi. On the foundation of the universal relation model. ACM Trans. on Database System (TODS), 9(2):283-308, 1984.
9. S. Nestorov, S. Abiteboul, and R. Motwani. Extracting schema from semistructured data. In Proc. 1998 ACM SIGMOD International Conference on Management of Data, pages 295-306, Seattle (Washington, USA), June 1998. ACM Press.
10. A. Rajaraman and J. D. Ullmann. Querying websites using compact skeletons. In Proc. 20th Symposium on Principles of Database Systems, pages 16-27, Santa Barbara (California, USA), May 2001. ACM Press.
11. J. D. Ullman. The U. R. strikes back. In Proc. of the ACM Symposium on Principles of Database Systems (PODS), pages 10-22, Los Angeles, (California), March 1982. ACM Press.
12. J. D. Ullman. Principles of Database and Kowledge Base Systems, volume II. Computer Science Press, 1989.
13. E. Wong and K. Youssefi. Decomposition-a strategy for query processing. ACM Trans. on Database Systems, 1(3):223-241, 1976.
14. M. Yannakakis. Algorithms for acyclic database schemes. In Proceedings of International Conference on Very Large Data Bases, pages 82-94. Morgan Kaufmann, 1981.
15. C. Yu and M. Özsoyoglu. An algorithm for tree-query membership of a distributed query. In Proceedings of IEEE COMPSAC, pages 306-312, 1979.