Sciweavers

27 search results - page 1 / 6
» Beyond simple aggregates: indexing for summary queries
Sort
View
PODS
2011
ACM
238views Database» more  PODS 2011»
12 years 7 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 6 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 4 months ago
Covering indexes for branching path queries
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...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
SENSYS
2004
ACM
13 years 10 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
13 years 8 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass