Sciweavers

806 search results - page 8 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
JSS
2008
139views more  JSS 2008»
13 years 7 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
DEBU
2000
118views more  DEBU 2000»
13 years 7 months ago
A Dynamic Query Processing Architecture for Data Integration Systems
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
Luc Bouganim, Françoise Fabret, C. Mohan, P...
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 2 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
STDBM
2004
Springer
143views Database» more  STDBM 2004»
14 years 28 days ago
Indexing Query Regions for Streaming Geospatial Data
This paper introduces the Dynamic Cascade Tree (DCT), a structure designed to index query regions on multi-dimensional data streams. The DCT is designed for a stream management sy...
Quinn Hart, Michael Gertz
DOCENG
2004
ACM
14 years 1 months ago
Querying XML documents by dynamic shredding
With the wide adoption of XML as a standard data representation and exchange format, querying XML documents becomes increasingly important. However, relational database systems co...
Hui Zhang 0003, Frank Wm. Tompa