Sciweavers

303 search results - page 27 / 61
» Using a compact tree to index and query XML data
Sort
View
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
14 years 7 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 7 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
BNCOD
2003
91views Database» more  BNCOD 2003»
13 years 9 months ago
Persistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...
Robert Japp
DATESO
2008
131views Database» more  DATESO 2008»
13 years 9 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca
ICDE
2007
IEEE
207views Database» more  ICDE 2007»
14 years 9 months ago
SIGOPT: Using Schema to Optimize XML Query Processing
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
Stelios Paparizos, Jignesh M. Patel, H. V. Jagadis...