611 search results - page 105 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
117
Voted
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
133
click to vote
TKDE
2008
15 years 4 months ago
2008
Malicious users can exploit the correlation among data to infer sensitive information from a series of seemingly innocuous data accesses. Thus, we develop an inference violation d...
147
click to vote
CGA
2005
15 years 4 months ago
2005
visualization to abstract data sets like network intrusion detection, recommender systems, and database query results. Although display algorithms are a critical component in the v...
156
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
155
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...