Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[robin parrot] Figure 1: Select for Lists flexibility to the kind of queries that can be posed to the database. Union and difference are similar to the corresponding operators in EXTRA EXCESS [9] However, the MDM algebra does not provide for operations on trees or graphs. The NST algebra [5] is specifically designed for structured office documents and is an extension of relational algebra. The data model is based on nested sequences of tuples. It tries to maintain the order of the input lists whenever possible, with a higher preference for the order of the first input list. For ....

Ralf Harmut Guting, Roberto Zicari, and David M. Choy, "An Algebra for Structured Office Documents," ACM Transactions on Office Information Systems 7 (1989), 123--157.

....to query locality. Finally, in Section 5 we describe a prototype implementation of WebSQL written in Java. We conclude in Section 6. Related Work There has been work in query languages for hypertext documents[BK90, CM89, MW93] as well as query languages for structured or semi structured documents[GZC89, ACM93, CACS94, QRS 95, Our work differs significantly from both these streams. None of these papers make a distinction between documents stored locally or remotely, or make an attempt to capitalize on existing index servers. As far as document structure, we only support the minimal ....

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

....Also, our way to capture index servers is more accurate because it does not assume they are perfect indexes. Other relevant work includes query languages for graph databases and hypertext documents[6, 11, 17, 18] as well as query languages for structured or semi structured documents such as [13, 4, 10], and for unstructured data[8] 2 Preliminaries We use a simple relational model of the Web to best highlight the essential computational issues. We first describe informally the main ideas, and then present our formal data model. Documents and Links: The World Wide Web is a large, ....

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

....to object oriented database instances by means of semantic actions attached to a grammar. Then the database representation can be queried using the query language of the database. A novel aspect of this approach is the possibility of querying the structure by means of path variables. Guting et al. GZC89] model documents using nested ordered relations and use a generalization of nested relational algebra as a query language. Beeri and Kornatzky [BK90] propose a logic whose formulas specify patterns over the hypertext graph. Graph query languages: Work in using graphs to model databases, ....

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

....query locality. Finally, in Section 5 we describe a prototype implementation of WebSQL written in Java. We conclude in Section 6. Related Work There has been work in query languages for hypertext documents[BK90, CM89, MW93] as well as query languages for structured or semi structured documents[GZC89, ACM93, CACS94, QRS 95] Our work differs significantly from both these streams. None of these papers make a distinction between documents stored locally or remotely, or make an attempt to capitalize on existing index servers. As far as document structure, we only support the minimal ....

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

....on extensibility, WebSQL [AMM96] that provides a formal semantics and introduce a notion of locality, or WebLog [LSS96] that is based on a Datalog like syntax. Since HTML (the core structure of the Web) can be viewed as an instance of SGML, the work on querying structured document, e.g. CACS94, GZC89] is also pertinent, along with work on querying semistructured data [Q 95, BDS95] The work on query languages for hypertext structures, e.g. MW95, CM89, MW93] is also relevant. In the next section, we introduce Web machines, browser machines, and browse search machines. We then formalize ....

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

....position dependent queries, which adds a lot more flexibility to the kind of queries that can be posed to the database. Union and difference are similar to the corresponding operators in EXTRA EXCESS [12] However, the MDM algebra does not provide for operations on trees or graphs. The NST algebra [6] is specifically designed for structured office documents and is an extension of relational algebra. The data model is based on nested sequences of tuples. It tries to maintain the order of the input lists whenever possible, with a higher preference for the order of the first input list. For ....

Ralf Harmut Guting, Roberto Zicari, and David M. Choy, "An Algebra for Structured Office Documents," ACM Transactions on Office Information Systems 7 (1989), 123--157.

....in this paper. Finally, in Section 5 we describe a prototype implementation of WebSQL written in Java. We conclude in Section 6. Related Work There has been work in query languages for hypertext documents [BK90, CM89, MW93] as well as query languages for structured or semi structured documents [GZC89, ACM93, CACS94, QRS 95, NBY95] Our work differs significantly from both these streams. None of these papers make a distinction between documents stored locally or remotely, or make an attempt to capitalize on existing index servers. As far as document structure, we only support the minimal ....

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

No context found.

Ralf Hartmut Guting, Roberto Zicari, and David M. Choy. An algebra for structured office documents. ACM TOIS, 7(2):123--157, 1989.

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