Sciweavers

2859 search results - page 61 / 572
» Querying Complex Structured Databases
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
WWW
2003
ACM
14 years 1 months ago
Using Index to Manage the Ordering Structure of XML Data in the Nested Relational Sequence Database System
In this poster, we introduce the mechanism of handling the ordering structure of XML data by using the Nested Relational Sequence Database System (NRSD), which is built upon the N...
Ho Lam Lau, Wilfred Ng
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 9 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICASSP
2009
IEEE
14 years 2 months ago
Voice search of structured media data
This paper addresses the problem of using unstructured queries to search a structured database in voice search applications. By incorporating structural information in music metad...
Young-In Song, Ye-Yi Wang, Yun-Cheng Ju, Mike Selt...
PODS
1998
ACM
116views Database» more  PODS 1998»
14 years 7 days ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka