SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Identifying aggregates in hypertext structures
HYPERTEXT '91 Proceedings of the third annual ACM conference on Hypertext
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Notes Explorer: entity-based retrieval in shared, semi-structured information spaces
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inferring structure in semistructured data
ACM SIGMOD Record
Extracting schema from semistructured data
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Cut as a querying unit for WWW, Netnews, and E-mail
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Object Exchange Across Heterogeneous Information Sources
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
ICDT '97 Proceedings of the 6th International Conference on Database Theory
| Hi-index | 0.00 |
In this paper, we propose an entity-oriented style of queries for semistructured data. A semistructured data represented by a large graph usually consists of subgraphs corresponding to real-world entities, in other words, subgraphs representing composite objects in object-oriented databse terminology. To detect such composite objects in semistructured data, we use the exclusiveness of references. If a reference is exclusive, then we regard it as a composite link, i.e. a link connecting parts of one composite object. Then we extend usual semistructured query languages by introducing new language constructs for path expressions that match only with composite links or non-composite links. By using those constructs in combination with wild cards, we can specify queries of a form like "retrieve all entities including these data items," which we call entity-oriented style queries. This style of query is useful especially when one does not have enough knowledge on the structure of the database.