Sciweavers

431 search results - page 1 / 87
» A Query Processing Strategy for the Decomposed Storage Model
Sort
View
ICDE
1987
IEEE
143views Database» more  ICDE 1987»
13 years 8 months ago
A Query Processing Strategy for the Decomposed Storage Model
Handling parallelism in database systems involves the specification of a storage model, a placement strategy, and a query processing strategy. An important goal is to determine th...
Setrag Khoshafian, George P. Copeland, Thomas Jago...
EDBT
1992
ACM
111views Database» more  EDBT 1992»
13 years 8 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
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 3 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
GVD
2001
142views Database» more  GVD 2001»
13 years 6 months ago
An approach to the model-based fragmentation and relational storage of XML-documents
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
Christian Süß