Access Restriction

Author Liang Su ♦ Bo Wang ♦ Peng Zou ♦ Yan Jia ♦ Ke Zuo ♦ ShuQiang Yang
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Special computer methods
Subject Keyword Indexing ♦ Costs ♦ Monitoring ♦ Temperature sensors ♦ Hardware ♦ Communications technology ♦ Random access memory ♦ Intrusion detection ♦ Spatial indexes ♦ Artificial intelligence
Abstract Emerging hardware and communication technologies enable new data stream applications that deal efficiently with very high rates of data updates. In this paper, we propose a novel index structure, termed the QDM-tree (quantized R*-tree with double memos), to support efficient similarity search over data streams. We integrate quantized minimum bounding spheres (QMBSs) and quantized minimum bounding rectangles (QMBRs) which can improve the cache behavior of QDM-tree due to effectively pack more entries in a node and reduce the tree height. Two compact main memory memos (Insert Memo and Delete Memo) can accelerate the speed of insert operations and convert the cost of update to the cost of insert. Therefore, the RamDisk technique reduces the cost of disk accesses to the cost of memory accesses. Theoretical analysis and experimental evaluation demonstrate that the QDM-tree significantly outperforms other state of the art R-tree variants with frequent updates, and is more suitable for massive data streams.
Description Author affiliation: Sch. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha (Liang Su; Bo Wang; Peng Zou; Yan Jia; Ke Zuo; ShuQiang Yang)
ISBN 9780769534404
ISSN 10823409
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-11-03
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 393.48 kB
Page Count 6
Starting Page 533
Ending Page 538

Source: IEEE Xplore Digital Library