✦ LIBER ✦

RE-tree: an efficient index structure for regular expressions

✍ Scribed by Chee-Yong Chan; Minos Garofalakis; Rajeev Rastogi

Book ID: 106234571
Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 338 KB
Volume: 12
Category: Article
ISSN: 1066-8888
DOI: 10.1007/s00778-003-0094-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

MR-tree: an efficient index for MapReduc

MR-tree: an efficient index for MapReduce

✍ Li, Chunsheng; Chen, Jie; Jin, Cheqing; Zhang, Rong; Zhou, Aoying 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 1004 KB

E-Tree: An Efficient Indexing Structure

E-Tree: An Efficient Indexing Structure for Ensemble Models on Data Streams

✍ Zhang, Peng; Zhou, Chuan; Wang, Peng; Gao, Byron J.; Zhu, Xingquan; Guo, Li 📂 Article 📅 2014 🏛 IEEE 🌐 English ⚖ 658 KB

Linearized Suffix Tree: an Efficient Ind

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and

✍ Dong Kyue Kim; Minhwan Kim; Heejin Park 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 777 KB

An efficient algorithm for finding kleen

An efficient algorithm for finding kleene closure of regular expression matrices

✍ Edward T. Lee 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 247 KB

The RS-tree: An efficient data structure

The RS-tree: An efficient data structure for distance browsing queries

✍ Dong-Joo Park; Shin Heu; Hyoung-Joo Kim 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 167 KB

An Efficient Method for Version Control

An Efficient Method for Version Control of a Tree Data Structure

✍ ESTHER JINEE CHOI; YONG RAE KWON 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

A new method for version controlling of a tree structure is presented. The key feature of the method is that the latest state of a tree is retained and other versions are constructed from it on request, and information on the change history of a node is maintaind in its parent node. Several algorith