Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The effect of adding relevance information in a relevance feedback environment
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
A technique for adding range restrictions to generalized searching problems
Information Processing Letters
Introduction to algorithms
New Upper Bounds for Generalized Intersection Searching Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Range Searching in Categorical Data: Colored Range Searching on Grid
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Optimizing Top-k Selection Queries over Multimedia Repositories
IEEE Transactions on Knowledge and Data Engineering
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
ACM SIGKDD Explorations Newsletter
Efficient Colored Orthogonal Range Counting
SIAM Journal on Computing
Space-Efficient Framework for Top-k String Retrieval Problems
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Efficient top-k queries for orthogonal ranges
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Top-K color queries for document retrieval
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.89 |
Top-K query processing is an important building block for ranked retrieval, with numerous applications. Top-K queries return a ranked set of the k best data objects based on the ranks/scores of the objects, assigned by some ranking/scoring function. In many applications, including databases and network routing, input objects are partitioned into categories denoted by distinct colors and a query asks for reporting the set of top-K categories of objects based on different aggregation functions like ''Max/Min'', ''Count'', etc. We consider a set of problems defined on colored geometric objects (points/intervals) in R^d (respectively in [0,U]^2). We are given a set S of n colored geometric objects in R^d (respectively in [0,U]^2). Optionally, each object p has a weight w(p)=0. The number of colors is m==1 and for case (ii) and (iii) in d=1 and dynamic solution is provided for case (i) in d=1. For case (iii) a static solution is also provided in [0,U]^2. Techniques include transformation to the uncolored top-K problem and persistence.