ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Versioning a full-text information retrieval system
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Synthetic workload performance analysis of incremental updates
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Incremental updates of inverted lists for text document retrieval
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Execution performance issues in full-text information retrieval
Execution performance issues in full-text information retrieval
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
STL tutorial and reference guide, second edition: C++ programming with the standard template library
STL tutorial and reference guide, second edition: C++ programming with the standard template library
Building a distributed full-text index for the web
ACM Transactions on Information Systems (TOIS)
Querying XML Documents Made Easy: Nearest Concept Queries
Proceedings of the 17th International Conference on Data Engineering
Fast Incremental Indexing for Full-Text Information Retrieval
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Detecting Changes in XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
In-place versus re-build versus re-merge: index maintenance strategies for text retrieval systems
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
This paper outlines the system architecture and the core data structures of Kalchas, a fulltext search engine for XML data with emphasis on dynamic indexing, and identifies features worth demonstrating. The concept of dynamic index implies that the aim is to re ect the creation of, deletion of, and updates to relevant files in the search index as early as possible. This is achieved by a number of techniques, including ideas drawn from partitioned B-Trees and inverted indices. The actual ranked retrieval of document is implemented with XML-specific query operators for lowest common ancestor queries.A live demonstration will discuss Kalchas' behaviour in typical use cases, such as interactive editing sessions and bulk loading large amounts of static files as well as querying the contents of the indexed files; it tries to clarify both the short-comings and the advantages of the method.