Name
Abstract | ||
|---|---|---|
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient search in flat strings into the second dimension to navigate in tree structured data. We consider the important XML data management task of prefiltering XML documents (also called XML projection) as an application for our approach. Different from existing prefiltering schemes we usually process only fractions of the input and get by with very economical consumption of both main memory and processing time. Our experiments reveal that already on low-complexity problems such as XPath filtering inmemory query engines can experience speed-ups by two orders of magnitude. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICDE.2008.4497471 | ICDE |
Keywords | Field | DocType |
string matching problem,i. i,xml prefiltering,flat string,prefiltering scheme,important xml data management,efficient search,inmemory query engine,economical consumption,xml document,prefiltering xml document,xml projection,new technique,project management,databases,navigation,face detection,acceleration,pattern matching,algorithm design and analysis,engines,memory management,algorithm design,xml,string matching,tree structure,filtering,tree data structures | String searching algorithm,Data mining,XML framework,XML,Computer science,XML validation,Tree (data structure),XML schema,XPath,Simple API for XML,Database | Conference |
ISSN | Citations | PageRank |
1084-4627 | 11 | 0.58 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Koch | 1 | 2817 | 163.43 |
| Stefanie Scherzinger | 2 | 209 | 20.82 |
| Michael Schmidt | 3 | 11 | 0.58 |