𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path Summaries and Path Partitioning in Modern XML Databases

✍ Scribed by Andrei Arion; Angela Bonifati; Ioana Manolescu; Andrea Pugliese

Publisher
Springer
Year
2007
Tongue
English
Weight
876 KB
Volume
11
Category
Article
ISSN
1386-145X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic graphoidal covers and path parti
Acyclic graphoidal covers and path partitions in a graph
✍ S. Arumugam; J. Suresh Suseela πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 436 KB

An acyclic graphoidal cover of a graph G is a collection $ of paths in G such that every path in $ has at least two vertices, every vertex of G is an internal vertex of at most one path in ~/and every edge of G is in exactly one path in $. The minimum cardinality of an acyclic graphoidal cover of G

Virtual path signature: An approach for
Virtual path signature: An approach for flexible searching in object-oriented databases
✍ Pichayotai Mahatthanapiwat; Wanchai Rivepiboon πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

Signature technique that is proposed for multikey indexing is used for flexible searching in the area of databases. In this article, we present a new signature technique called Virtual Path Signature for supporting query processing of aggregation hierarchy as a tree in object-oriented databases (OOD

On the possibility of path expressions c
On the possibility of path expressions containing backward navigations in object-oriented databases
✍ Nobutaka Suzuki; Minoru Ito; Jun Okui πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 723 KB

A path expression in object-oriented databases is an accepted means of navigating over database objects. A backward navigation in a path expression is an operation to find the objects that have a given target object as a given property value. A path expression pd is called possible with respect to a