610 search results - page 28 / 122 » Efficient Query Evaluation on Probabilistic Databases |
EDBT
2008
ACM
16 years 18 days ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
123
click to vote
SSDBM
2008
IEEE
15 years 6 months ago
2008
IEEE
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
121
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
178
Voted
SIGMOD
2005
ACM
16 years 19 days ago
2005
ACM
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
100
Voted
ADBIS
1998
Springer
15 years 4 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...