2063 search results - page 145 / 413 » Containment of Aggregate Queries |
143
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
273
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
145
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
When searching large hypertext document collections, it is often possible that there are too many results available for ambiguous queries. Query refinement is an interactive proce...
169
click to vote
ICDCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
139
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...