470 search results - page 40 / 94 » Privacy-Preserving Queries over Relational Databases |
VLDB
2001
ACM
14 years 9 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
PVLDB
2008
13 years 8 months ago
2008
Recently, a number of papers have been published showing the benefits of column stores over row stores. However, the research comparing the two in an "apples-to-apples" ...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...
ADBIS
2000
Springer
14 years 1 months ago
2000
Springer
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
SIGMOD
2002
ACM
14 years 8 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...