VLDB
2006
ACM
14 years 11 months ago
2006
ACM
100
click to vote
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
100
click to vote
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
101
click to vote
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
The objective of extensible DBMSs is to ease the construction of specialized DBMSs for nontraditional applications. Although much work has been done in providing various levels of ...
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
VLDB
2006
ACM
14 years 11 months ago
2006
ACM
: Moving Objects Databases have become an important research issue in recent years. For and querying moving objects, there exists a comprehensive framework of abstract data types t...