Sciweavers

591 search results - page 57 / 119
» The complexity of XPath query evaluation
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 2 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
LICS
2002
IEEE
14 years 1 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 10 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 2 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
CSB
2005
IEEE
155views Bioinformatics» more  CSB 2005»
14 years 2 months ago
BioNavigation: Using Ontologies to Express Meaningful Navigational Queries Over Biological Resources
Exploiting the complex maze of publicly available Biological resources to implement scientific data collection pipelines poses a multitude of challenges to biologists in accurate...
Zoé Lacroix, Kaushal Parekh, Maria-Esther V...