Sciweavers

43 search results - page 5 / 9
» The complexity of satisfying constraints on databases of tra...
Sort
View
WEBI
2001
Springer
13 years 12 months ago
A Data Model for XML Databases
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
Vilas Wuwongse, Kiyoshi Akama, Chutiporn Anutariya...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 4 months ago
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
VLDB
1990
ACM
101views Database» more  VLDB 1990»
13 years 11 months ago
Non-Monotonic Knowledge Evolution in VLKDBs
Non-monotonic knowledge evolutions and exceptions constitute a complex theoritical and practical problem. The state of the art shows a rich and surprising diversity of approaches....
Christian Esculier
EDBT
2008
ACM
154views Database» more  EDBT 2008»
14 years 7 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis