Sciweavers

491 search results - page 40 / 99
» Optimizing Large OODB Queries
Sort
View
ADC
2009
Springer
178views Database» more  ADC 2009»
14 years 2 months ago
CSC: Supporting Queries on Compressed Cached XML
Whenever a client frequently has to retrieve, to query and to locally transform large parts of a huge XML document that is stored on a remote web information server, data exchange...
Stefan Böttcher, Rita Hartel
DEXA
2004
Springer
79views Database» more  DEXA 2004»
14 years 1 months ago
Querying Distributed Data in a Super-Peer Based Architecture
Data integration is a significant challenge: relevant data objects are split across multiple information sources, and often owned by different organizations. The sources represent...
Zohra Bellahsene, Mark Roantree
DEXA
2005
Springer
112views Database» more  DEXA 2005»
14 years 1 months ago
Distribution Rules for Array Database Queries
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
Alex van Ballegooij, Roberto Cornacchia, Arjen P. ...
AMW
2010
13 years 9 months ago
Run-time Optimization for Pipelined Systems
Traditional optimizers fail to pick good execution plans, when faced with increasingly complex queries and large data sets. This failure is even more acute in the context of XQuery...
Riham Abdel Kader, Maurice van Keulen, Peter A. Bo...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 19 hour ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...