[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3335484.3335523acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicbdcConference Proceedingsconference-collections
research-article

An Index with Caching Mechanism for Real-time Processing System

Published: 10 May 2019 Publication History

Abstract

Real-time processing mode is becoming a mainstream technology in many domains. For example, real-time monitoring system can effectively improve the power engineering or the efficiency of the transport sector. On behalf of a data structure to accelerate retrieval, indexing plays a vital role in data processing. That is because a well-designed index can reduce the time complexity of retrieval from O(n) to O(log n) or even O(1). Generally speaking, index, such as B-tree and R-tree, are designed for the speed of data retrieval rather than data update. To keep the real-time data, a large number of data updating tasks need to be performed in real-time processing system. However, the update speed of these indexes cannot meet the requirement of real-time processing system. In this paper, we present a caching mechanism before the updates of the index. In particular, we change the mode of index's update from one-by-one to batch operation by maintaining an inserting cache and a deleting cache. Our experiments show that this caching mechanism can effectively improve the index update speed by using the data of power grid system, while it has little impact on the speed of index retrieval.

References

[1]
J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett., 1991.
[2]
P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA, 1993.
[3]
P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426--435, 1997.
[4]
T. Bozkaya and Z. M. Özsoyoglu. Indexing large metric spaces for similarity search queries. TODS, 24(3):361--404, 1999.
[5]
S. T. Leutenegger, M. Lopez, J. Edgington, et al. Str: A simple and efficient algorithm for r-tree packing. In ICDE, pages 497--506, 1997.
[6]
A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47--57, 1984
[7]
Tao Y, Papadias D. Efficient historical R-trees. In?Proc, of the 13th Int'l Conf. on Scientific and Statistical Database Management (SSDBM 2001). IEEE, 2001. 223--232.
[8]
Nascimento MA, Silva JRO. Towards historical R-trees?In?Proc. Of the '98 ACM Symp. on Applied Computing. ACM Press, 1998. 235--240.
[9]
Theodorakis Y, Vazirgiannis M, Sellis T. Spatio-Temporal indexing for large multimedia applications. On Multimedia Computing and Systems. IEEE, 1996. 441--448.
[10]
Guttman A. R-Trees: A dynamic index structure for spatial searching. ACM SIGMOD Record, 1984, 14(2): 47--57.
[11]
Zhu Q' Gong J, Zhang Y. An efficient 3D R-tree spatial index method for virtual geographic environments. ISPRS Journal of Photogrammetry & Remote Sensing, 2007, 62(3): 217--224

Cited By

View all
  • (2023)Real-Time Search-Driven Content Delivery in Vehicular Networks for AR/VR-Enabled Autonomous Vehicles2023 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCC57788.2023.10233627(1-6)Online publication date: 10-Aug-2023

Index Terms

  1. An Index with Caching Mechanism for Real-time Processing System

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICBDC '19: Proceedings of the 4th International Conference on Big Data and Computing
    May 2019
    353 pages
    ISBN:9781450362788
    DOI:10.1145/3335484
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    In-Cooperation

    • Shenzhen University: Shenzhen University
    • Sun Yat-Sen University

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 10 May 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. B-tree
    2. Caching Mechanism
    3. R-tree
    4. Real-time Processing System

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Funding Sources

    • State Grid Corporation of China
    • National Key R&D Program of China

    Conference

    ICBDC 2019

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 12 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Real-Time Search-Driven Content Delivery in Vehicular Networks for AR/VR-Enabled Autonomous Vehicles2023 IEEE/CIC International Conference on Communications in China (ICCC)10.1109/ICCC57788.2023.10233627(1-6)Online publication date: 10-Aug-2023

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media