A. Mendelzohn, G.A. Mihaila, and T. Milo. Querying the world wide web. In Proceedings of PDIS, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....SgmlQL actually goes beyond the querying, with primitives to construct new trees from existing ones, however, as any of these languages, it does not address the problem of conversion to a different DTD. Various languages for querying the WWW in a database style have been developed [KS95] [MMM96], AMT96] The approach is to build a model for a set of homogeneous pages and to query the a server through this model. As the model includes the notion of links, the query language allows for searching for specific elements in pages, as well following links. Languages for building documents ....

A. Mendelzohn, G. A. Milhaila, and T. Milo, "Querying the World Wide Web", PDIS, 1996, available at ftp: ftp.math.tau.ac.il/pub/milo/websql.ps

....a variety of database contexts, ranging from hypertext data to object oriented databases. Typically, navigational queries are expressed using regular expressions denoting paths in the graph representing the data. Such path queries have assumed renewed interest in the context of semistructured data [2, 28, 5, 11, 22, 30, 27] as found for instance in the Web and in particular for querying XML [1] We focus on a path query evaluation that takes advantage of local knowledge about the data graph. We consider such This work was performed while the author was visiting the CS dept. at Stanford U. Work supported in part by ....

....constraints, and its use in optimizing the evaluation of path queries. We use here an abstraction of semistructured data as a set of objects linked by labeled directed edges. In Web terminology, an object can be viewed as a page, and the labeled edges as hypertext links. We focus on path queries [12, 20, 13, 3, 24, 5, 11, 22, 30], which have emerged as an important class of browsing style queries on graph data. Path queries are of the form find all objects reachable by paths whose labels form a word in r, where r is a regular expression over an alphabet of labels. In the context of the Web, we believe that queries ....

[Article contains additional citation context not shown here]

A. Mendelzohn, G. A. Mihaila, and T. Milo. Querying the World Wide Web. In Proc. PDIS, 1996.

....role of a schema for an OEM database. We plan to consider adapting the optimization techniques of [CCM96] to OEM using the data guide. Also related to our work are several query languages for the World Wide Web that have emerged recently, e.g. W3QL [KS95] which focuses on extensibility, WebSQL [MMM96] which provides a formal semantics and introduces a notion of locality, and WebLog [LSS96] which is based on a Datalog like syntax. Additional relevant work includes query languages for hypertext structures, e.g. MW95, BK94, CM89, MW93] and work on integrating SGML [GR90] documents with ....

A. Mendelzohn, G. A. Mihaila, and T. Milo. Querying the world wide web, 1996. Draft.

....a variety of database contexts, ranging from hypertext data to object oriented databases. Typically, navigational queries are expressed using regular expressions denoting paths in the graph representing the data. Such path queries have assumed renewed interest in the context of semistructured data [1, 24, 4, 9, 19, 26, 23]) as found for instance in the Web. We focus on a path query evaluation that takes advantage of local knowledge about the data graph. We consider such local knowledge represented as path constraints. The main contribution of the paper is the study of the implication problem for path constraints, ....

....Systems Center under ARPA Contract F33615 93 11339, and by the Air Force Rome Laboratories under ARPA Contract F30602 95 C 0119. y This author supported in part by the National Science Foundation under grant number IRI 9221268. beled edges as hypertext links. We focus on path queries [10, 17, 11, 2, 20, 4, 9, 19, 26], which have emerged as an important class of browsing style queries on graph data. Path queries are of the form find all objects reachable by paths whose labels form a word in r, where r is a regular expression over an alphabet of labels. In the context of the Web, we believe that queries ....

[Article contains additional citation context not shown here]

A. Mendelzohn, G. A. Mihaila, and T. Milo. Querying the World Wide Web. In Proc. PDIS, 1996.

....to implement the algorithms described here. The presented maintenance algorithm can be used both for immediate maintenance [8] and for deferred maintenance [38, 16] of the views. The general ideas presented here are also applicable to query languages for semistructured data [11] for the Web [27, 31], and (to some extent) to query languages for hypertext documents [14, 5] 2 View Specification We use the Lore system [29] to investigate materialized view maintenance over semistructured data. Lore implements OEM. We now introduce OEM, the Lorel query language, the view specification language, ....

A. O. Mendelzohn, G. A. Mihaila, and T. Milo. Querying the World Wide Web. In Proceedings of the 4th International Conference on Parallel and Distributed Information Systems (PDIS), Miami Beach, Florida, Dec. 1996.

....Typically, navigational queries are expressed using regular expressions denoting paths in the graph representing the data. Such path queries have assumed renewed interest in the context of semi structured data such as that commonly found in the Web (e.g. QRS 95, AQM 96, BDHS96, MMM96, Suc96] In this paper, we consider the processing of path queries in a distributed asynchronous environment. We focus on path query evaluation that takes advantage of local knowledge about the data graph, of the kind that might be available on the Web. We consider such local knowledge ....

....evaluation of path queries. We use here an abstraction of the Web as a set of objects linked by labeled edges. An object represents a page (and possibly a site) and the labeled edges represent hypertext links. We focus on path queries [CM90, KKS92, dBV93, CACS94, MW95, AQM 96, BDHS96, MMM96, Suc96] which have emerged as an important class of browsing style queries on the Web. Path queries are of the form find all objects reachable by paths whose labels form a word in r, where r is a regular expression over an alphabet of labels. We present a basic scenario for evaluating such ....

[Article contains additional citation context not shown here]

A. Mendelzohn, G. A. Mihaila, and T. Milo. Querying the World Wide Web. In Proc. PDIS, 1996.

.... on query languages that may be relevant here, e.g. besides the ones we already cited, deductive languages (see [Ull89, AHV94] query languages for hypertext structures ( MW95, BK90, CM89, MW93] languages for data integration [PGMW95, PGMU96] and, recently, query languages for the Web ( KS95, MMM96, LSS96] Remark. Database query languages have been traditionally used for extracting data from a database. They also serve to specify views. The notion of view is particularly important here since we often want to consider the same object from various perspectives or with various precisions ....

A. Mendelzohn, G. A. Mihaila, and T. Milo. Querying the World Wide Web. In Proc. PDIS, 1996.

.... These languages, as well as DSSSL, could be used for implementing library coercion functions to map complex or frequently used structures, but are beyond the reach of document writers because of their complexity, Various languages for querying the Web in a database style have been developed [6,15,19]. They allow searching for specific elements in pages, as well following links, but they do not support querying the full SGML structure. Languages for building documents from existing sources of information have been less explored. SGML offers a static way of assembling entities from external ....

A. Mendelzohn, G. A. Milhaila, and T. Milo, "Querying the World Wide Web", PDIS, 1996, available at ftp: ftp.math.tau.ac.il/pub/milo/websql.ps

No context found.

A. Mendelzohn, G.A. Mihaila, and T. Milo. Querying the world wide web. In Proceedings of PDIS, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC