Expressing structural hypertext queries in graphlog
HYPERTEXT '89 Proceedings of the second annual ACM conference on Hypertext
A logical query language for hypertext systems
Hypertext: concepts, systems and applications
Querying object-oriented databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Information gathering in the World-Wide Web: the W3QL query language and the W3QS system
ACM Transactions on Database Systems (TODS)
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Queries on Structures in Hypertext
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Queries and Computation on the Web
ICDT '97 Proceedings of the 6th International Conference on Database Theory
A Declarative Language for Querying and Restructuring the Web
RIDE '96 Proceedings of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems
| Hi-index | 0.00 |
The World-Wide Wed presents new challenges to database researchers, especially in the area of query processing. Currently, querying the World-Wide Wed is done by using online indices. These sites employ search engines, know as "robots", that scan the network periodically and form text based indices. A severe limitation of these search services is that the structural information, namely the organization of documents into parts pointing to each other, is lost. Several tasks, ranging from data mining to Intranet management, require the analysis of the hypertext structural organization. In this paper, we propose a simple graph based query language. In this language, both the query and its target are graphs. We present and evaluate the efficiency of a general class of algorithms for answering graph queries. The algorithms' definitions take into account two important facts of the WWW: (1) efficient algorithms must minimize the communication needed to answer a query and (2) query evaluation involves a process of data graph exploration.