Sciweavers

53 search results - page 6 / 11
» Preferential Regular Path Queries
Sort
View
PODS
2004
ACM
131views Database» more  PODS 2004»
14 years 10 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
Piero A. Bonatti
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
VLDB
1990
ACM
116views Database» more  VLDB 1990»
14 years 1 months ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
NIL
1991
14 years 1 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
13 years 11 months ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...