Sciweavers

6740 search results - page 72 / 1348
» Querying Databases with Taxonomies
Sort
View
208
Voted
SIGMOD
2005
ACM
228views Database» more  SIGMOD 2005»
16 years 2 months ago
ConQuer: Efficient Management of Inconsistent Databases
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
Ariel Fuxman, Elham Fazli, Renée J. Miller
ICDE
1991
IEEE
175views Database» more  ICDE 1991»
15 years 5 months ago
Constraint-Based Reasoning in Deductive Databases
— Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investi...
Jiawei Han
127
Voted
OTM
2005
Springer
15 years 7 months ago
Object-Oriented Wrapper for Relational Databases in the Data Grid Architecture
: The paper presents a solution of the problem of wrapping relational databases to an object-oriented business model in the data grid architecture. The main problem with this kind ...
Kamil Kuliberda, Jacek Wislicki, Radoslaw Adamus, ...
98
Voted
BMCBI
2005
107views more  BMCBI 2005»
15 years 1 months ago
An edit script for taxonomic classifications
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
Roderic D. M. Page, Gabriel Valiente
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 4 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli