165 search results - page 10 / 33 » Auditing Sum Queries |
CCCG
2006
13 years 11 months ago
2006
In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the o...
CCCG
2009
13 years 10 months ago
2009
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
ICDCS
2010
IEEE
14 years 1 months ago
2010
IEEE
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
TKDE
2008
13 years 9 months ago
2008
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...