610 search results - page 70 / 122 » Efficient Query Evaluation on Probabilistic Databases |
173
click to vote
VLDB
2007
ACM
16 years 26 days ago
2007
ACM
In large-scale distributed information systems, where participants are autonomous and have special interests for some queries, query allocation is a challenge. Much work in this c...
203
click to vote
GIS
2007
ACM
16 years 1 months ago
2007
ACM
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
170
Voted
SIGMOD
2006
ACM
16 years 23 days ago
2006
ACM
Real-world data -- especially when generated by distributed measurement infrastructures such as sensor networks -- tends to be incomplete, imprecise, and erroneous, making it impo...
116
click to vote
DOLAP
2005
ACM
15 years 2 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
124
Voted
PRIS
2004
15 years 2 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...