Sciweavers

486 search results - page 58 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
SAC
2011
ACM
14 years 4 months ago
Site-autonomous distributed semantic caching
Semantic caching augments cached data with a semantic description of the data. These semantic descriptions can be used to improve execution time for similar queries by retrieving ...
Norvald H. Ryeng, Jon Olav Hauglid, Kjetil N&oslas...
DAWAK
2000
Springer
15 years 5 months ago
Optimal Multidimensional Query Processing Using Tree Striping
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
Stefan Berchtold, Christian Böhm, Daniel A. K...
USENIX
2007
15 years 3 months ago
Hyperion: High Volume Stream Archival for Retrospective Querying
Network monitoring systems that support data archival and after-the-fact (retrospective) queries are useful for a multitude of purposes, such as anomaly detection and network and ...
Peter Desnoyers, Prashant J. Shenoy
CIKM
2009
Springer
15 years 4 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 7 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu