93 search results - page 11 / 19 » Efficient Table Anonymization for Aggregate Query Answering |
SIGMOD
2002
ACM
15 years 11 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
182
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
166
click to vote
VLDB
2008
ACM
15 years 12 months ago
2008
ACM
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
102
click to vote
TKDE
2008
14 years 11 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...
102
click to vote
SIGMOD
1996
ACM
15 years 3 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...