Sciweavers

43 search results - page 1 / 9
» Efficiently Supporting Ad Hoc Queries in Large Datasets of T...
Sort
View
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
13 years 9 months ago
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences
Flip Korn, H. V. Jagadish, Christos Faloutsos
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 8 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
14 years 6 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
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
13 years 8 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
13 years 11 months ago
Seaweed: Distributed Scalable Ad Hoc Querying
Many emerging applications such as wide-area network management need to query large, structured, highly distributed datasets. Seaweed is a distributed scalable infrastructure for ...
Richard Mortier, Dushyanth Narayanan, Austin Donne...