Stanford InfoLab Publication Server

Queries and Computation on the Web

Abiteboul, S. and Vianu, V. (1996) Queries and Computation on the Web. Technical Report. Stanford InfoLab. (Publication Note: Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997)




The paper introduces a model of the Web as an infinite, semistructured 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 broand 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.

Item Type:Techreport (Technical Report)
Subjects:Computer Science > Databases and the Web
Related URLs:Project Homepage
ID Code:146
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:08 Dec 2008 14:25

Download statistics

Repository Staff Only: item control page