KUKU

KU ScholarWorks

  • myKU
  • Email
  • Enroll & Pay
  • KU Directory
    • Login
    View Item 
    •   KU ScholarWorks
    • Office of the Provost
    • Provost Office Published Articles
    • View Item
    •   KU ScholarWorks
    • Office of the Provost
    • Provost Office Published Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Efficient Bulk Operations on Dynamic R-trees

    Thumbnail
    View/Open
    AHV99.bulk.pdf (291.2Kb)
    Issue Date
    2002-12
    Author
    Arge, Lars
    Hinrichs, Klaus H.
    Vahrenhold, Jan
    Vitter, Jeffrey Scott
    Publisher
    Springer Verlag
    Type
    Article
    Article Version
    Scholarly/refereed, author accepted manuscript
    Metadata
    Show full item record
    Abstract
    In recent years, there has been an upsurge of interest in spatial databases. A major issue is how to efficiently manipulate massive amounts of spatial data stored on disk in multidimensional spatial indexes (data structures). Construction of spatial indexes (bulk loading) has been studied intensively in the database community. The continuous arrival of massive amounts of new data makes it important to e ciently update existing indexes (bulk updating). In this paper, we present a simple, yet e cient technique for performing bulk update and query operations on multidimensional indexes. We present our technique in terms of the so-called R-tree and its variants, as they have emerged as practically e cient indexing methods for spatial data. Our method uses ideas from the bu er tree lazy bu ering technique and fully utilizes the available internal memory and the page size of the operating system. We give a theoretical analysis of our technique, showing that it is e cient both in terms of I/O communication, disk storage, and internal computation time. We also present the results of an extensive set of experiments showing that in practice our approach performs better than the previously best known bulk update methods with respect to update time, and that it produces a better quality index in terms of query performance. One important novel feature of our technique is that in most cases it allows us to perform a batch of updates and queries simultaneously. To be able to do so is essential in environments where queries have to be answered even while the index is being updated and reorganized.
    Description
    The original publication is available at www.springerlink.com
    URI
    http://hdl.handle.net/1808/7199
    DOI
    https://doi.org/10.1007/s00453-001-0107-6
    Collections
    • Provost Office Published Articles [95]
    • Electrical Engineering and Computer Science Scholarly Works [301]
    • Distinguished Professors Scholarly Works [918]
    Citation
    L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. “Efficient Bulk Operations on Dynamic R-trees,” special issue on experimental algorithmics in Algorithmica, 33(1), May 2002, 104–128. An extended abstract appears in Proceedings of the 1st Workshop on Algorithm Engineering and Experimentation (ALENEX ’99), Baltimore, MD, January 1999, 328–348. http://dx.doi.org/10.1007/s00453-001-0107-6

    Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.


    We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.


    Contact KU ScholarWorks
    785-864-8983
    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    785-864-8983

    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    Image Credits
     

     

    Browse

    All of KU ScholarWorksCommunities & CollectionsThis Collection

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    Contact KU ScholarWorks
    785-864-8983
    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    785-864-8983

    KU Libraries
    1425 Jayhawk Blvd
    Lawrence, KS 66045
    Image Credits
     

     

    The University of Kansas
      Contact KU ScholarWorks
    Lawrence, KS | Maps
     
    • Academics
    • Admission
    • Alumni
    • Athletics
    • Campuses
    • Giving
    • Jobs

    The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.

     Contact KU
    Lawrence, KS | Maps