Queries and computation on the web

@article{citeulike:2635566, abstract = {. 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...}, author = {Abiteboul, Serge and Vianu, Victor }, citeulike-article-id = {2635566}, journal = {Theoretical Computer Science}, number = {2}, pages = {231--255}, posted-at = {2008-04-06 23:11:08}, priority = {3}, title = {Queries and computation on the web}, url = {http://citeseer.ist.psu.edu/abiteboul97queries.html}, volume = {239}, year = {2000} }

TY - JOUR ID - citeulike:2635566 L3 - citeulike-article-id:2635566 TI - Queries and computation on the web JF - Theoretical Computer Science VL - 239 IS - 2 SP - 231 EP - 255 N2 - . 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... AU - Abiteboul, Serge AU - Vianu, Victor PY - 2000/// UR - http://citeseer.ist.psu.edu/abiteboul97queries.html ER -