Non first normal form relations: An algebra allowing data restructuring
Journal of Computer and System Sciences
Communication and concurrency
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
STRUDEL: a Web site management system
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Possibilities and limitations of using flat operators in nested algebra expressions
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
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
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Fixpoint Calculus for Querying Semistructured Data
WebDB '98 Selected papers from the International Workshop on The World Wide Web and Databases
| Hi-index | 0.00 |
Semi-structured data are commonly represented by labelled graphs. The labels may be strings, integers, . . . Thus their type is atomic. They are carried by edges and/or nodes. In this paper, we investigate a nested graph representation of semi-structured data. Some nodes of our graphs may be labelled by graphs. Our motivation is to bring the data model in use closer to the natural presentation of data, in particular closer to the Web presentation. The main purpose of the paper is to provide query languages of reasonable expressive power for querying nested db-graphs.