Sciweavers

363 search results - page 17 / 73
» Linked Data Query Processing Strategies
Sort
View
EDBT
1992
ACM
111views Database» more  EDBT 1992»
14 years 1 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
COMAD
2008
13 years 11 months ago
Runtime Optimization of Continuous Queries
In data stream processing systems, Quality of Service (or QoS) requirements, as specified by users, are extremely important. Unlike in a database management system (DBMS), a query...
Balakumar Kendai, Sharma Chakravarthy
IPPS
2005
IEEE
14 years 3 months ago
Evaluation of Rate-Based Adaptivity in Asynchronous Data Stream Joins
Continuous query systems are an intuitive way for users to access streaming data in large-scale scientific applications containing many hundreds of streams. A challenge in these ...
Beth Plale, Nithya N. Vijayakumar
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 3 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
WWW
2008
ACM
13 years 9 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou