F-Index: A Flattened Structural Index for Speeding up Twig Query Processing
نویسندگان
چکیده
منابع مشابه
An Efficient XML Index Structure with Bottom-Up Query Processing
With the growing importance of XML in data exchange, much research has been done in proving flexible query mechanisms to extract data from structured XML documents. The semi-structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. Recently, ViST that uses suffix tree and BTree was proposed to reduce the search time of the docum...
متن کاملSpeeding up Index Construction with Gpu for Dna Data Sequences
The advancement of technology in scientific community has produced terabytes of biological data. This datum includes DNA sequences. String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because of the large size of DNA data and also the small number of alphabets. To overcome this problem, the indexing methods such as suffix arrays or ...
متن کاملA Path-Oriented RDF Index for Keyword Search Query Processing
Most of the recent approaches to keyword search employ graph structured representation of data. Answers to queries are generally sub-structures of the graph, containing one or more keywords. While finding the nodes matching keywords is relatively easy, determining the connections between such nodes is a complex problem requiring onthe-fly time consuming graph exploration. Current techniques suf...
متن کاملTreeguide Index: Enabling Efficient XML Query Processing
XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML documents. In this paper, we first survey some of them and suggest a classification scheme. It appears that most techniques are indexing on paths in XML documents and maintain a separated index on values. In some cases, the...
متن کاملFast Query Processing Using Cooperative CPU Caching for Index Structures
Index data structures are an important component of database applications. Our measurements show that for a memory resident CSB+-tree (Cache Sensitive B+ tree), the cache miss penalty now accounts for over 50% of the total running time. This is exacerbated by current trends. As a result of Moore’s law, both the CPU speed and the DRAM density have doubled every 18 months. However the cache miss ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2007
ISSN: 1000-9825
DOI: 10.1360/jos181429