Incorporating updates in domain indexes: Experiences with oracle spatial R-trees

被引:1
|
作者
Kothuri, RKV [1 ]
Ravada, S [1 ]
An, N [1 ]
机构
[1] Oracle Corp, Spatial Technol, NEDC, Nashua, NH 03062 USA
关键词
D O I
10.1109/ICDE.2004.1320042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Much research has been devoted to scalable storage and retrieval techniques for domain databases such as spatial, text, xml and gene sequence data. Many efficient indexing techniques have been developed in this context. Given the improvement in the underlying technology, database applications are increasingly using domain data in transactional semantics. In this paper we examine the issue of when during the lifetime of a transaction is it better to incorporate updates in domain indexes. We present our experiences with R-tree indexes in Oracle. We examine two approaches for incorporating updates in spatial R-tree indexes: the first at update time, and the second at commit time. The first approach immediately incorporates changes in the index right away using system transactions and at commit time makes them visible to other transactions. The second approach, referred to as the deferred-incorporate approach, defers the updates in a secondary table and incorporates the changes in the index only at commit time. In experiments on real data sets, we compare the performance of the two approaches. For most transactions with reasonable number of update operations, we observe that the deferred approach outperforms the immediate-incorporate approach significantly for update operations and with appropriate optimizations achieves comparable query performance.
引用
收藏
页码:745 / 753
页数:9
相关论文
共 18 条
  • [1] Spatial joins and R-trees
    Martynov, MG
    ADVANCES IN DATABASES AND INFORMATION SYSTEMS, 1996, : 295 - 304
  • [2] Spatial data accesses with semantic R-trees
    Chen, SC
    Wang, XR
    Rishe, N
    Weiss, MA
    PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 584 - 587
  • [3] Managing Frequent Updates in R-Trees for Update-Intensive Applications
    Song, MoonBae
    Kitagawa, Hiroyuki
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (11) : 1573 - 1589
  • [4] Parallel processing of spatial joins using R-trees
    Brinkhoff, T
    Kriegel, HP
    Seeger, B
    PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1996, : 258 - 265
  • [5] Efficient processing of spatial joins using R-trees
    Brinkhoff, Thomas
    Kriegel, Hans-Peter
    Seeger, Bernhard
    SIGMOD Record, 1993, 22 (02) : 237 - 246
  • [6] The RUM-tree: supporting frequent updates in R-trees using memos
    Yasin N. Silva
    Xiaopeng Xiong
    Walid G. Aref
    The VLDB Journal, 2009, 18 : 719 - 738
  • [7] The RUM-tree: supporting frequent updates in R-trees using memos
    Silva, Yasin N.
    Xiong, Xiaopeng
    Aref, Walid G.
    VLDB JOURNAL, 2009, 18 (03): : 719 - 738
  • [8] Efficient cost models for spatial queries using R-trees
    Theodoridis, Y
    Stefanakis, E
    Sellis, T
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2000, 12 (01) : 19 - 32
  • [9] Indexing implementation for vague spatial regions with R-trees and grid files
    Petry, Frederick E.
    Ladner, Roy
    Somodevilla, Maria
    GEOGRAPHIC UNCERTAINTY IN ENVIRONMENTAL SECURITY, 2007, : 187 - +
  • [10] Using branch-grafted R-trees for spatial data mining
    Dubey, P
    Chen, ZX
    Shi, Y
    COMPUTATIONAL SCIENCE - ICCS 2004, PT 1, PROCEEDINGS, 2004, 3036 : 657 - 660