Sciweavers

493 search results - page 43 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
16 years 14 days ago
Capability-Sensitive Query Processing on Internet Sources
On the Internet, the limited query-processing capabilities of sources make answering even the simplest queries challenging. In this paper, we present a scheme called GenCompact fo...
Hector Garcia-Molina, Wilburt Labio, Ramana Yernen...
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
15 years 2 months ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 15 days ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
SSD
2007
Springer
124views Database» more  SSD 2007»
15 years 5 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
CIKM
2009
Springer
15 years 5 months ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang