Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
