Queries and computation on the Web

  • Serge Abiteboul
  • Victor Vianu
Contributed Papers Session 4: New Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)


The paper introduces a model of the Web as an infinite, semi-structured set of objects. We reconsider the classical notions of genericity and computability of queries in this new context and relate them to styles of computation prevalent on the Web, based on browsing and searching. We revisit several well-known declarative query languages (first-order logic, Datalog, and Datalog with negation) and consider their computational characteristics in terms the notions introduced in this paper. In particular, we are interested in languages or fragments thereof which can be implemented by browsing, or by browsing and searching combined. Surprisingly, stratified and well-founded semantics for negation turn out to have basic shortcomings in this context, while inflationary semantics emerges as an appealing alternative.


Query Language Input Tape Source Object Tape Head Output Tape 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A97]
    S. Abiteboul. Querying semi-structured data. This proceedings.Google Scholar
  2. [AHV94]
    S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading-Massachusetts, 1994.Google Scholar
  3. [AV88]
    S. Abiteboul and V. Vianu. Procedural and declarative database update languages. In Proc. ACM PODS, pages 240–250, 1988.Google Scholar
  4. [BDS95]
    P. Buneman, S. Davidson, and D. Suciu. Programming constructs for unstructured data. In Proc. DBPL, 1995.Google Scholar
  5. [BLCL+94]
    [BLCL+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.Google Scholar
  6. [CACS94]
    V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl. From structured documents to novel query facilities. In Proc. ACM SIGMOD, pages 313–324, 1994.Google Scholar
  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.CrossRefGoogle Scholar
  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.Google Scholar
  9. [Gel89]
    A. Van Gelder. The alternating fixpoint of logic programs with negation. In Proc. ACM PODS, pages 1–11, 1989.Google Scholar
  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.Google Scholar
  11. [GZC89]
    R. Güting, R. Zicari, and D. M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123–157, 1989.Google Scholar
  12. [HH93]
    D. Harel and T. Hirst. Completeness Results for Recursive Data Bases. In Proc. ACM PODS, pages 244–252, 1993.Google Scholar
  13. [KKR90]
    P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. In Proc. ACM PODS, pages 299–313, 1990.Google Scholar
  14. [KP88]
    P. G. Kolaitis and C.H. Papadimitriou. Why not negation by fixpoint? In Proc. ACM PODS, pages 231–239, 1988.Google Scholar
  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.Google Scholar
  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.Google Scholar
  17. [MMM96]
    G. Mihaila, A. Mendelzon, and T. Milo. Querying the World Wide Web. In Proc. PDIS, 1996. Also available in Scholar
  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.Google Scholar
  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.Google Scholar
  20. [Q+95]
    D. Quass et al. Querying semistructured heterogeneous information. In Proc. DOOD, pages 319–344, Springer-Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Serge Abiteboul
    • 1
  • Victor Vianu
    • 2
  1. 1.Computer Science DepartmentStanford UniversityStanford
  2. 2.Univ. of California at San DiegoLa Jolla

Personalised recommendations