Sciweavers

208 search results - page 8 / 42
» Efficient Computation of Multiple Group By Queries
Sort
View
HPDC
2010
IEEE
13 years 8 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 7 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 9 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 7 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ITICSE
2004
ACM
14 years 1 months ago
Use of large databases for group projects at the nexus of teaching and research
Final year, group (capstone) projects in computing disciplines are often expected to fill multiple roles: in addition to allowing students to learn important domain-specific knowl...
Richard C. Thomas, Rebecca Mancy