Sciweavers

2859 search results - page 23 / 572
» Querying Complex Structured Databases
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 10 days ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 9 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ER
2005
Springer
136views Database» more  ER 2005»
14 years 1 months ago
A Semantic Approach to Query Rewriting for Integrated XML Data
Query rewriting is a fundamental task in query optimization and data integration. With the advent of the web, there has been renewed interest in data integration, where data is dis...
Xia Yang, Mong-Li Lee, Tok Wang Ling, Gillian Dobb...
DEXA
2003
Springer
108views Database» more  DEXA 2003»
14 years 1 months ago
Exploiting Similarity of Subqueries for Complex Query Optimization
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
Yingying Tao, Qiang Zhu, Calisto Zuzarte
DBA
2004
111views Database» more  DBA 2004»
13 years 9 months ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...