Sciweavers

511 search results - page 66 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 6 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
16 years 7 months ago
Efficient Table Anonymization for Aggregate Query Answering
Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonym...
Cecilia M. Procopiuc, Divesh Srivastava
143
Voted
DAWAK
1999
Springer
15 years 10 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...
DCC
2000
IEEE
15 years 10 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
WEBDB
2004
Springer
122views Database» more  WEBDB 2004»
15 years 11 months ago
Querying Bi-level Information
In our research on superimposed information management, we have developed applications where information elements in the superimposed layer serve to annotate, comment, restructure...
Sudarshan Murthy, David Maier, Lois M. L. Delcambr...