Sciweavers

DKE
2010
101views more  DKE 2010»
13 years 4 months ago
Effective pruning for XML structural match queries
Extensible Markup Language (XML) is becoming the de facto standard for exchanging information over the Internet, which results in the proliferation of XML documents. This has led ...
Yefei Xin, Zhen He, Jinli Cao
DAWAK
2010
Springer
13 years 5 months ago
Benchmarking Spatial Data Warehouses
Spatial data warehouses (SDW) enable analytical multidimensional queries together with spatial analysis. Mainly, three operations are related to SDW query processing performance: (...
Thiago Luís Lopes Siqueira, Ricardo Rodrigu...
VLDB
2000
ACM
151views Database» more  VLDB 2000»
13 years 8 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
14 years 4 months ago
Reliable Storage and Querying for Collaborative Data Sharing Systems
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
Nicholas E. Taylor, Zachary G. Ives
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 4 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
WWW
2009
ACM
14 years 5 months ago
Using graphics processors for high performance IR query processing
Web search engines are facing formidable performance challenges as they need to process thousands of queries per second over billions of documents. To deal with this heavy workloa...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel