A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Query languages for bags and aggregate functions
Journal of Computer and System Sciences - Special issue on principles of database systems
Information Systems - Special issue on semistructured data
WWW '99 Proceedings of the eighth international conference on World Wide Web
Queries and computation on the Web
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Local properties of query languages
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Hi-index | 0.00 |
In this paper, we study the safety of formulas, computability and local property of Web queries. The limited access capability and loosely structured information make querying the Web significantly different from querying a conventional database. When evaluating queries on the Web, it is not feasible to exhaustively examine all objects on the Web. The local property, studied in this paper, can be informally described as the reverse scenario: in order to check if an object participated in the result of a Web query, is it sufficient to examine a bounded portion of the Web? We start our investigation by using the Web machine proposed by Mendelzon and Milo [1]. We review the genericity, domain independence and computability of Web queries. We present a syntactic class of local Web queries and a sound algorithm to check if a query belongs to this class. We then examine the notion of locality of two popular XML query languages, namely XPath and XQuery, and show that they are not local.