In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...
Location-based services and data mining algorithms analyzing objects moving on a complex traffic network are becoming increasingly important. In this paper, we introduce a new app...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
Database views are extensively used to represent unmaterialized tables. Applications rarely distinguish between a materialized base table and a virtual view, thus, they may issue ...
This paper describes how to fit fractal models, online, on IP traffic data streams. Our approach relies on maintaining a sketch of the data stream and fitting straight lines: it y...
Physical database design is critical to the performance of a large-scale DBMS. The corresponding automated design tuning tools need to select the best physical design from a large...
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
Ruoming Jin, Leonid Glimcher, Chris Jermaine, Gaga...
We propose a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining. In our MIC framework, we first d...
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...