Queries and computation on the Web

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

Volumn 1186, Issue , 1997, Pages 262-275

  Abiteboul, Serge ^a   Vianu, Victor ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; QUERY LANGUAGES; SEMANTICS;

DATALOG; DECLARATIVE QUERY LANGUAGES; FIRST ORDER LOGIC; GENERICITY; SEMI-STRUCTURED; WELL FOUNDED SEMANTICS;

QUERY PROCESSING;

EID: 84948962715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62222-5_50     Document Type: Conference Paper

References (20)

1. [A97] S. Abiteboul. Querying semi-structured data. This proceedings.
2. [AHV94] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading-Massachusetts, 1994.
3. [AV88] S. Abiteboul and V. Vianu. Procedural and declarative database update languages. In Proc. ACM PODS, pages 240-250, 1988.
4. [BDS95] P. Buneman, S. Davidson, and D. Suciu. Programming constructs for unstructured data. In Proc. DBPL, 1995.
5. +94] T. Berners-Lee, R. Cailliau, A. Luotonen, H. Nielsen, and A. Secret. The World-Wide Web. Comm, of the ACM, 37(8):76-82, 1994.
6. [CACS94] V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl. Prom structured documents to novel query facilities. In Proc. ACM SIGMOD, pages 313-324, 1994.
7. [CH80] A.K. Chandra and D. Harel. Computable queries for relational data bases. Journal of Computer and System Sciences, 21(2):156-178, 1980.
8. [CM89] M. P. Consens and A. O. Mendelzon. Expressing structural hypertext queries in graphlog. In Proc. 2nd. ACM Conference on Hypertext, pages 269-292, 1989.
9. [Gel89] A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. ACM PODS, pages 1-11, 1989.
10. [GRS88] A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. In Proc. ACM PODS, pages 221-230, 1988.
11. [GZC89] R. Güting, R. Zicari, and D. M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123-157, 1989.
12. [HH93] D. Harel and T. Hirst. Completeness Results for Recursive Data Bases. In Proc. ACM PODS, pages 244-252, 1993.
13. [KKR90] P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. In Proc. ACM PODS, pages 299-313, 1990.
14. [KP88] P. G. Kolaitis and C.H. Papadimitriou. Why not negation by fixpoint? In Proc. ACM PODS, pages 231-239, 1988.
15. [KS95] D. Konopnicki and O. Shmueli. W3QS: A query system for the World Wide Web. In Proc. of VLDB'95, pages 54-65, 1995.
16. [LSS96] V. S. Lakshmanan, F. Sadri, and I. N. Subramanian. A declarative language for querying and restructuring the Web. In Proc. of 6th. International Workshop on Research Issues in Data Engineering, RIDE '96, New Orleans, February 1996.
17. [MMM96] G. Mihaila, A. Mendelzon, and T. Milo. Querying the World Wide Web. In Proc. PDIS, 1996. Also available in ftp://db.toronto.edu/pdis96.ps.Z
18. [MW93] T. Minohara and R. Watanabe. Queries on structure in hypertext. In Proc. Foundations of Data Organization and Algorithms, pages 394-411, Springer-Verlag, 1993.
19. [MW95] A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. SIAM J. Comp., 24(6), pages 1235-1258, 1995.
20. +95] D. Quass et al. Querying semistructured heterogeneous information. In Proc. DOOD, pages 319-344, Springer-Verlag, 1995.