25 search results - page 3 / 5 » Efficient Processing of Top-k Dominating Queries on Multi-Di... |
EXPDB
2006
ACM
13 years 11 months ago
2006
ACM
In data warehousing applications, the ability to efficiently delete large chunks of data from a table is very important. This feature is also known as Rollout. Rollout is generall...
ICDE
2006
IEEE
14 years 7 months ago
2006
IEEE
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems....
EDBT
2009
ACM
13 years 9 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
AAAI
2008
13 years 8 months ago
2008
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...