C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proceeding of the European Conference on Hypertext, pages 67--80, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....though to follow an explicit finite number of global links. 6. Related work Other works have looked at querying structured or semi structured information, either from a database point of view [4, 11] from a document processing point of view, as with HyQ [2] or SgmlQL [16] or for hypertexts [9, 8, 19]. Our selection of objects is similar to the generalized path expressions found in POQL [11] or Gram [8] however, their interpretation is much simplified since our paths are concrete paths into untyped tree structures that are not constrained to a database schema. This need to query ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext system. In Proceedings of the first European Conference on Hypertext, pages 67--80. Canbridge University Press, 1990.

....ownership by actions that version pages by means of annotations and rewriting requests. 5. Comparison Little research has been conducted into formalising personalisation in HLBSs themselves. Most work has concentrated on providing personalisation features via data querying mechanisms (e.g. [1, 3, 11]) Although these contributions show how personalisation may be experienced, it can be argued that they merely exploit DBMS functionality rather than account for how hyperlink based interaction itself can be tailored in a principled manner. We have formalised (in [16] a complete space of ....

C. Beeri and Y. Kornatzky. A Logical Query Language for Hypertext Systems. In Proc. ECHT'90 European Conf. on Hypertext, pages 67--80, 1990.

....contrasts the proposed framework with related work on modelling and implementing personalisation in HLBSs. Little research has been conducted into formalising personalisation in HLBSs themselves. Most work has concentrated on providing personalisation features via data querying mechanisms (e.g. [1, 3, 12]) Although these contributions show how personalisation may be experienced, it can be argued that they merely exploit DBMS functionality rather than account for how hyperlink based interaction itself can be tailored in a principled manner. We have formalised (in [18] a complete space of ....

C. Beeri and Y. Kornatzky. A Logical Query Language for Hypertext Systems. In Proc. ECHT'90 European Conf. on Hypertext, pages 67--80, 1990.

....in the definition of graph models and languages to allow a natural way of handling data appearing in applications such as hypertext or geographic database systems. Standard data models are often inefficient as they do not capture the inherent structure of data representing hypertext documents [4, 7, 18] or networks (highways, rivers, 12] In this paper, we present a graph data model. Its application to hypertext querying is illustrated by an example of a travel agency that organizes journeys. We think of a hypertext as a directed labeled graph where the nodes are typed documents and ....

....to modify graph databases. Nodes and edges can be added and removed in subgraphs satisfying a given graph pattern. Opposed to GraphLog, the underlying data model is object oriented and functional edges are distinguished from non functional (multivalued) edges. Among other related approaches, [4] describes a query language for hypertexts which is based on modal logics and [5] is an extension of SQL for querying graph relations. 7 Future Work 7.1 Queries and Scripts Assume an agency employee prepares a new trip using information already existing in the hypertext database. He would like ....

C. Beeri and Y. Kornatzky, A logical query language for hypertext systems, ECHT '90, 67--80, Versailles, Nov. 1990.

....hypertext based query processing. Analysis of files that have a strict innerstructure is treated in [6] Such analysis is essential for WWW query processing and is performed, to a limited extent, by W3QS. The Graphlog language [8] can be used for the graphical specification of search patterns. In [7], Beeri and Kornatzky define a logicbased language to state structure specifying queries on a hypertext structure. Their formulae uniformly treat structural aspects, content aspects and boolean operations. Their language is capable of altering the hypertext structure. A query language on a ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proceeding of the European Conference on Hypertext, pages 67--80. Cambridge University Press, 1990.

....model and a blue print of a query language for the WWW (based on the object oriented paradigm) new research directions concerning WWW query processing and the concept of data stability . Due to space limitation, we only reference relevant related works. Query languages for hypertext appear in [10, 6, 28], and for text files in [1, 4] WWW query languages that use graphs or regular expressions are described in [22, 27] WebLog [23] is a query language based on Datalog. Kogan et al. 20] introduce semantic intra page objects and a language for querying them. Theoretical models of the WWW have been ....

Beeri, C., Kornatzky, Y., A Logical Query Language for Hypertext Systems. In Proceeding of the European Conference on Hypertext , 1990.

.... of large hypertext applications, for many reasons: ffl Typing has been proven in hypertext as an aid for structuring (Nanard and Nanard 1991; Garzotto, Paolini, and Schwabe 1993) ffl Querying in hypertext has often been stated as a requirement (Halasz 1988; Consens and Mendelzon 1989; Beeri and Kornatzky 1990; Amann and Scholl 1992; Lucarella, Parisotto, and Zanzi 1993) Typing in our model is an aid not only to structuring, but also to querying. We admit that this could be even more effective if coupled to information retrieval by contents, but it is not in the scope of our work. ffl In addition to ....

....Agarwal 1988) The following graph based models and query languages are to our knowledge the first systematic uses of database modeling, not only as an authoring tool, but also as a reader query based navigation tool. All of these approaches (Consens and Mendelzon 1989; Afrati and Koutras 1990; Beeri and Kornatzky 1990; Amann and Scholl 1992; Lucarella et al. 1993) use queries for selecting (typed) paths in the graph of documents. Compared to other approaches using SQL and relational algebra (Gallagher, Furuta, and Stotts 1990) they are more powerful since they allow some recursion in paths. However, the ....

[Article contains additional citation context not shown here]

Beeri, C. and Y. Kornatzky (1990, November). A logical query language for hypertext systems. In Proceedings of the First European Conference on Hypertext and Hypermedia (ECHT'90), Versailles, pp. 67--80.

....is given by using an extended example of a travel agency application. 1 Introduction Recent database research work [7, 8, 11, 4, 16] shows a growing interest in the definition of graph models and languages to allow a natural way of handling data appearing in applications such as hypertext [6, 3] or geographic database [10] systems. Standard data models are often inefficient as they do not capture the inherent structure of data representing hypertext documents or networks (highways, rivers, In this paper, we address the problem of hypertext querying. We think of a hypertext as a ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proc. of the 1st European Conf. on Hypertext and Hypermedia (ECHT'90), pages 67--80, Versailles, November 1990.

....given in Suite on formal methods or analysis of the underlying protocol. A commercial package, Design CPN, is available from MetaSoftware providing extensive editing capabilities for building hierarchical colored Petri nets. Temporal logic has been used to describe structural aspects of hypertext [BK90], but the goal in that work is to define subgraphs of a structure rather than the dynamics of browsing, as in Trellis. The only project we know of other than Trellis that uses temporal logic for PT net analysis is by Sinachopoulos [Sin89] the emphasis in this work is on timing in a timed net ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In A. Rizk, N. Streitz, and J. Andr'e, editors, Hypertext: Concepts, Systems, and Applications, pages 67--80. Cambridge University Press, November 1990. Proceedings of the European Conference on Hypertext.

....needed to answer a query and (2) query evaluation involves a process of data graph exploration. Related Work Due to space limitations, we only reference relevant related works: WWW query languages and data models [14, 11, 9, 12] WWW restructuring languages [3, 7, 2] and hypertext query languages [4, 15]. In [13] the authors propose an algorithm to answer a particular class of graph queries: the regular simple path queries. Their algorithm does not take into account the cost of exploring the data graph and considers it as free. Data graph exploration is certainly not free in the context of the ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proceeding of the European Conference on Hypertext, pages 67--80, 1990.

....model is to represent the document logical structure as well as the hypertext links. Supporting search and query in a hypermedia network has been an important issue that should be addressed in the hypermedia systems [12] Many query languages have been proposed. For example, Beeri and Kornatzky [4] have proposed a logical query language, Amann and Scholl [1] have presented a graph data model and query language, and Schutt and Streitz [24] have defined a hypertext query language called HTQL. However, they have not considered the logical document structure. Christophides et al. 10] have ....

C. Beeri and Y. Kornatzky, "A Logical Query Language for Hypertext Systems," Proc. of the First European Conference on Hypertext, 1990.

....nets [35] exploring the differences between branching time and partial order logics. It is suggested to apply UB [5] CTL [15] CTL [13] and POTL [31] to the study of the firing sequences in place transition nets. Emphasis is on an axiomatic specification approach. Finally, Berri at al. [4] have presented a method for using a modal (temporal) logic for structural queries in a hyperdocument. A document is treated as a graph, with the goal of a query being to locate a particular subgraph. Queries in the temporal logic are essentially structural patterns to be matched against the ....

Beeri, C., and Kornatzky, Y. A logical query language for hypertext systems. In Hypertext: Concepts, Systems, and Applications, A. Rizk, N. Streitz, and J. Andr'e, Eds. Cambridge University Press, Nov. 1990, pp. 67--80. Proceedings of the European Conference on Hypertext.

....a particular query. We give an algorithm for characterizing WebSQL queries with respect 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 ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proc. of the European Conference on Hypertext, pages 67--80. Cambridge University Press, 1990.

....queries. The information conveyed in the hypertext organization itself is queried. The entity selected by this type of query is a set of nodes (and edges) from the hypertext structure (in our case, a subgraph of the WWW LGraph is selected) each satisfying the query s graph pattern [21] 7][4]. Of course, one may combine these basic types and state more complex queries [4] 4.1.1 Content Queries in W3QL. The information found on the WWW is mostly stored as unstructured data (files) whereas database systems are mainly concerned with structured data (such as tables) However, in order ....

....queried. The entity selected by this type of query is a set of nodes (and edges) from the hypertext structure (in our case, a subgraph of the WWW LGraph is selected) each satisfying the query s graph pattern [21] 7] 4] Of course, one may combine these basic types and state more complex queries [4]. 4.1.1 Content Queries in W3QL. The information found on the WWW is mostly stored as unstructured data (files) whereas database systems are mainly concerned with structured data (such as tables) However, in order to allow a database like access to the WWW, information that is found in files ....

[Article contains additional citation context not shown here]

Beeri, C., Kornatzky, Y., A Logical Query Language for Hypertext Systems. In Proceeding of the European Conference on Hypertext, pages 67--80, Cambridge University Press, 1990.

....formalism provides a logic based and semantic way to represent knowledge. CGKAT exploits the relation of specialization between CGs for queries. Other kinds of queries are necessary for IR, e.g. the search of paths, and the search of nodes according to the number of relations they are connected to (Beeri Kornatsky, 1990). In addition, for document retrieval or any other search using superficial representations of DEs for indexing them, the IR techniques must also handle the recall and precision factors (here, the indexation goal is not to really represent information for enabling users to directly find it ....

Beeri C. & Kornatsky Y. (1990). A Logical Query Language for Hypertext Systems.

....to follow an explicit finite number of global links. 6. Related research work Other works have looked at querying structured or semi structured information, either from a database point of view [3, 10] from a document processing point of view, as with HyQ [2] or SgmlQL [15] or for hypertexts [8, 7, 18]. Our selection of objects is similar to the generalized path expressions found in POQL [10] or Gram [7] however, their interpretation is much simplified since our paths are concrete paths into untyped tree structures that are not constrained to a database schema. This need to query ....

C. Beeri and Y. Kornatzky. A logical query language for hypertext system. In Proceedings of the first European Conference on Hypertext, pages 67--80. Canbridge University Press, 1990.

....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, and the update operations. 4] and [3] provide further details on Lorel ....

C. Beeri and Y. Kornatski. A Logical Query Language for Hypertext Systems. In Proceedings of the 16th International Conference on Very Large Databases (VLDB), Brisbane, Australia, Aug. 1990.

....paradigm, they could also be applied for the file system paradigm with some changes. Search and query in a hypermedia network has been an important issue that should be supported in hypermedia systems [10] Many query languages for hypermedia documents have been proposed to address that issue [1] [3] [26] even though they considered only the hypertext network structure without paying attention to the logical tree structure within hypermedia nodes. Hypermedia systems can provide more powerful query facilities by supporting queries on both the hyperlink structure and the logical tree ....

C. Beeri and Y. Kornatzky, "A Logical Query Language for Hypertext Systems," Proc. of the First European Conf. on Hypertext, pp. 67-80, INRIA, France, Nov. 1990.

No context found.

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proceeding of the European Conference on Hypertext, pages 67--80, 1990.

No context found.

Beeri, C. / Kornatzky, Y. "A logical query language for hypertext systems" in EC'90 [EC'90]

No context found.

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In Proc. of the European Conference on Hypertext, pages 67--80. Cambridge University Press, 1990.

No context found.

Beeri, C., and Kornatzky, Y. A logical query language for hypertext systems. In Hypertext: Concepts, Systems, and Applications, A. Rizk, N. Streitz, and J. Andr'e, Eds. Cambridge University Press, Nov. 1990, pp. 67--80. Proceedings of the European Conference on Hypertext.

No context found.

C. Beeri and Y. Kornatzky. A logical query language for hypertext systems. In A. Rizk, N. Streitz, and J. Andr'e, editors, Hypertext: Concepts, Systems, and Applications, pages 67--80. Cambridge University Press, November 1990. Proceedings of the European Conference on Hypertext.

No context found.

C. Beeri and Y. Kornatzky, A logical query language for hypertext systems. In Proceeding of the European Conference on Hypertext (1990), Cambridge University Press, pp. 67--80.

No context found.

Beeri, C. and Kornatzky, Y. (1990). "A Logical Query Language for Hypertext Systems" Proceedings of the European Conference on Hypertext, ECHT'90.

First 50 documents

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