Sciweavers

200 search results - page 13 / 40
» Datalog Queries of Set Constraint Databases
Sort
View
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
13 years 11 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 9 months ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...
EDBTW
2006
Springer
13 years 11 months ago
Semantically Correct Query Answers in the Presence of Null Values
For several reasons a database may not satisfy a given set of integrity constraints (ICs), but most likely most of the information in it is still consistent with those ICs; and cou...
Loreto Bravo, Leopoldo E. Bertossi
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 8 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
DLOG
2008
13 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer