Sciweavers

611 search results - page 105 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 12 months ago
On Optimal Node Splitting for R-trees
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...
Yván J. García, Mario A. Lopez, Scot...
TKDE
2008
122views more  TKDE 2008»
13 years 7 months ago
Protection of Database Security via Collaborative Inference Detection
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...
Yu Chen, Wesley W. Chu
CGA
2005
13 years 7 months ago
Designing a Visualization Framework for Multidimensional Data
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...
Brent M. Dennis, Sarat Kocherlakota, Amit P. Sawan...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 15 days ago
Fast approximate correlation for massive time-series data
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...
Abdullah Mueen, Suman Nath, Jie Liu
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu