610 search results - page 17 / 122 » Efficient Query Evaluation on Probabilistic Databases |
MFDBS
1989
15 years 1 months ago
1989
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
SSDBM
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
DASFAA
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
113
click to vote
ICDT
2011
ACM
14 years 1 months ago
2011
ACM
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...