Efficient Exploratory Searches With an Incremental R-Tree Under Oscillating Workloads
Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in...
Uloženo v:
| Vydáno v: | IEEE access Ročník 13; s. 106916 - 106931 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Piscataway
IEEE
2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 2169-3536, 2169-3536 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in varying volume and frequency. To address these challenges, this paper presents an Incremental R-tree index structure optimized for real-time storage and querying of large-scale spatial datasets under dynamic conditions. The proposed method employs a two-stage overflow mechanism, where newly arriving data batches are first distributed into a grid-based structure and then selectively integrated into the tree leaves based on query activity. This approach delays full indexing until it becomes necessary, thereby improving responsiveness and avoiding unnecessary tree restructuring. Furthermore, the Incremental R-tree adaptively incorporates principles from both STR-tree and <inline-formula> <tex-math notation="LaTeX">{\mathrm{R}}^{\ast } </tex-math></inline-formula>-tree to enhance indexing efficiency. Experimental results demonstrate that the Incremental R-tree significantly reduces cumulative query response latency compared to traditional <inline-formula> <tex-math notation="LaTeX">{\mathrm{R}}^{\ast } </tex-math></inline-formula>-tree and STR-tree structures under oscillating workloads, and consistently outperforms the widely used GiST-based R-tree implementation in PostGIS. |
|---|---|
| AbstractList | Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in varying volume and frequency. To address these challenges, this paper presents an Incremental R-tree index structure optimized for real-time storage and querying of large-scale spatial datasets under dynamic conditions. The proposed method employs a two-stage overflow mechanism, where newly arriving data batches are first distributed into a grid-based structure and then selectively integrated into the tree leaves based on query activity. This approach delays full indexing until it becomes necessary, thereby improving responsiveness and avoiding unnecessary tree restructuring. Furthermore, the Incremental R-tree adaptively incorporates principles from both STR-tree and <tex-math notation="LaTeX">${\mathrm{R}}^{\ast }$ </tex-math>-tree to enhance indexing efficiency. Experimental results demonstrate that the Incremental R-tree significantly reduces cumulative query response latency compared to traditional <tex-math notation="LaTeX">${\mathrm{R}}^{\ast }$ </tex-math>-tree and STR-tree structures under oscillating workloads, and consistently outperforms the widely used GiST-based R-tree implementation in PostGIS. Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in varying volume and frequency. To address these challenges, this paper presents an Incremental R-tree index structure optimized for real-time storage and querying of large-scale spatial datasets under dynamic conditions. The proposed method employs a two-stage overflow mechanism, where newly arriving data batches are first distributed into a grid-based structure and then selectively integrated into the tree leaves based on query activity. This approach delays full indexing until it becomes necessary, thereby improving responsiveness and avoiding unnecessary tree restructuring. Furthermore, the Incremental R-tree adaptively incorporates principles from both STR-tree and <inline-formula> <tex-math notation="LaTeX">{\mathrm{R}}^{\ast } </tex-math></inline-formula>-tree to enhance indexing efficiency. Experimental results demonstrate that the Incremental R-tree significantly reduces cumulative query response latency compared to traditional <inline-formula> <tex-math notation="LaTeX">{\mathrm{R}}^{\ast } </tex-math></inline-formula>-tree and STR-tree structures under oscillating workloads, and consistently outperforms the widely used GiST-based R-tree implementation in PostGIS. Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data analysis. In particular, oscillating workloads can significantly hinder data access performance due to the continuous influx of spatial records in varying volume and frequency. To address these challenges, this paper presents an Incremental R-tree index structure optimized for real-time storage and querying of large-scale spatial datasets under dynamic conditions. The proposed method employs a two-stage overflow mechanism, where newly arriving data batches are first distributed into a grid-based structure and then selectively integrated into the tree leaves based on query activity. This approach delays full indexing until it becomes necessary, thereby improving responsiveness and avoiding unnecessary tree restructuring. Furthermore, the Incremental R-tree adaptively incorporates principles from both STR-tree and [Formula Omitted]-tree to enhance indexing efficiency. Experimental results demonstrate that the Incremental R-tree significantly reduces cumulative query response latency compared to traditional [Formula Omitted]-tree and STR-tree structures under oscillating workloads, and consistently outperforms the widely used GiST-based R-tree implementation in PostGIS. |
| Author | Kalay, Mustafa Utku |
| Author_xml | – sequence: 1 givenname: Mustafa Utku orcidid: 0000-0002-8002-0268 surname: Kalay fullname: Kalay, Mustafa Utku email: ukalay@yildiz.edu.tr organization: Computer Engineering Department, Yildiz Technical University, İstanbul, Türkiye |
| BookMark | eNpNUd9LHDEQDmKh1voX1IeFPu-Z7Gw22Uc5rvZAEHoePoa5ZKK5rptrsoL-98au1M7LDMP3Y4bvCzse40iMfRN8IQTvLy6Xy9Vms2h4IxcgtWg5HLGTRnR9DRK64__mz-ws5z0vpctKqhO2XXkfbKBxqlbPhyEmnGJ6qTaEyT5Qru7C9FDhWK1Hm-ixwHCoftW3iajajo5SdZNtGAacwnhf3cX0e4jo8lf2yeOQ6ey9n7Ltj9Xt8md9fXO1Xl5e1xY6MdWILXeOyApUEh30ikvbgtMSuFYcpYOu97Rru6bR1mrnbSeskjtELD94OGXrWddF3JtDCo-YXkzEYP4uYro3mKZgBzLgvBe61who2wbbHagOrQYhAZW3WLS-z1qHFP88UZ7MPj6lsZxvoGnKbQoULyiYUTbFnBP5f66Cm7c4zByHeYvDvMdRWOczKxDRB0PwtvhzeAXDc4h2 |
| CODEN | IAECCG |
| Cites_doi | 10.14778/3598581.3598596 10.1109/mdm.2012.40 10.1145/3626742 10.1145/3318464.3389703 10.1007/s00453-001-0107-6 10.1145/2452376.2452461 10.1145/2619228.2619232 10.1145/971697.602266 10.1109/RIVF.2015.7049885 10.1016/j.ipl.2006.07.010 10.14778/2831360.2831361 10.1007/978-3-319-66854-3_14 10.1145/3397506 10.1007/s002360050048 10.1007/s00778-019-00555-y 10.1007/s00778-024-00876-7 10.14778/3407790.3407829 10.14778/3303753.3303759 10.1145/1007568.1007608 10.1145/2396761.2398577 10.1023/A:1013764014000 10.1109/ICDE.1997.582015 10.1007/s00607-019-00709-4 10.14778/3641204.3641206 10.14778/3574245.3574253 10.1145/170088.170403 10.1145/1142473.1142549 10.1145/288692.288723 10.1145/93605.98741 10.1016/j.datak.2005.07.011 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA |
| DOI | 10.1109/ACCESS.2025.3581403 |
| DatabaseName | IEEE Xplore (IEEE) IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 106931 |
| ExternalDocumentID | oai_doaj_org_article_3dff1898a3ac42a4b376ac83153a7fca 10_1109_ACCESS_2025_3581403 11043150 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Yildiz Technical University Scientific Research Projects Coordinatorship grantid: FKD-2024-6620 |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c361t-aa40ddeec1a75ad39705c43d8530870a5d369feb46228cc8dfc61c75baaa000f3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001516410000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2169-3536 |
| IngestDate | Fri Oct 03 12:53:35 EDT 2025 Sat Nov 01 15:15:27 EDT 2025 Sat Nov 29 07:52:07 EST 2025 Wed Aug 27 01:37:11 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0/legalcode |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c361t-aa40ddeec1a75ad39705c43d8530870a5d369feb46228cc8dfc61c75baaa000f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-8002-0268 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/11043150 |
| PQID | 3223977370 |
| PQPubID | 4845423 |
| PageCount | 16 |
| ParticipantIDs | ieee_primary_11043150 crossref_primary_10_1109_ACCESS_2025_3581403 doaj_primary_oai_doaj_org_article_3dff1898a3ac42a4b376ac83153a7fca proquest_journals_3223977370 |
| PublicationCentury | 2000 |
| PublicationDate | 20250000 2025-00-00 20250101 2025-01-01 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – year: 2025 text: 20250000 |
| PublicationDecade | 2020 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2025 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref35 ref12 ref34 ref15 ref36 ref31 ref30 ref11 ref33 ref10 ref2 ref1 ref16 ref19 ref18 Xing (ref24) 2024 ref23 ref25 ref20 ref22 ref21 Hussain Moti (ref17) 2024 Gu (ref14) 2021 ref28 Stonebraker (ref26) 2005; 5 ref27 ref8 ref7 ref9 ref4 ref3 ref6 ref5 Pavlovic (ref29) (ref32) 2017 |
| References_xml | – ident: ref30 doi: 10.14778/3598581.3598596 – ident: ref8 doi: 10.1109/mdm.2012.40 – ident: ref12 doi: 10.1145/3626742 – ident: ref13 doi: 10.1145/3318464.3389703 – ident: ref18 doi: 10.1007/s00453-001-0107-6 – volume: 5 start-page: 553 year: 2005 ident: ref26 article-title: C-store: A column-oriented DBMS publication-title: Proc. VLDB Endowment – ident: ref27 doi: 10.1145/2452376.2452461 – ident: ref31 doi: 10.1145/2619228.2619232 – ident: ref1 doi: 10.1145/971697.602266 – ident: ref7 doi: 10.1109/RIVF.2015.7049885 – ident: ref6 doi: 10.1016/j.ipl.2006.07.010 – ident: ref11 doi: 10.14778/2831360.2831361 – ident: ref21 doi: 10.1007/978-3-319-66854-3_14 – year: 2024 ident: ref17 article-title: Fast and adaptive bulk loading of multidimensional points publication-title: arXiv:2409.09447 – ident: ref9 doi: 10.1145/3397506 – ident: ref33 doi: 10.1007/s002360050048 – ident: ref36 doi: 10.1007/s00778-019-00555-y – year: 2021 ident: ref14 article-title: A reinforcement learning based R-tree for spatial data indexing in dynamic environments publication-title: arXiv:2103.04541 – ident: ref35 doi: 10.1007/s00778-024-00876-7 – ident: ref15 doi: 10.14778/3407790.3407829 – ident: ref34 doi: 10.14778/3303753.3303759 – ident: ref5 doi: 10.1145/1007568.1007608 – ident: ref10 doi: 10.1145/2396761.2398577 – ident: ref19 doi: 10.1023/A:1013764014000 – ident: ref2 doi: 10.1109/ICDE.1997.582015 – ident: ref22 doi: 10.1007/s00607-019-00709-4 – volume-title: 2016 Yellow Taxi Trip Data year: 2017 ident: ref32 – year: 2024 ident: ref24 article-title: The AHA-tree: An adaptive index for HTAP workloads publication-title: arXiv:2406.08746 – ident: ref25 doi: 10.14778/3641204.3641206 – ident: ref16 doi: 10.14778/3574245.3574253 – ident: ref4 doi: 10.1145/170088.170403 – ident: ref23 doi: 10.1145/1142473.1142549 – ident: ref3 doi: 10.1145/288692.288723 – start-page: 325 volume-title: Proc. 21st Int. Conf. Extending Database Technol. (EDBT) ident: ref29 article-title: QUASII: Query-aware spatial incremental index – ident: ref28 doi: 10.1145/93605.98741 – ident: ref20 doi: 10.1016/j.datak.2005.07.011 |
| SSID | ssj0000816957 |
| Score | 2.334151 |
| Snippet | Traditional spatial index structures face challenges in efficiently managing dynamic and irregular workloads, which are common in real-time spatial data... |
| SourceID | doaj proquest crossref ieee |
| SourceType | Open Website Aggregation Database Index Database Publisher |
| StartPage | 106916 |
| SubjectTerms | Data analysis Data ingestion Data structures Distributed databases exploratory search Indexing Libraries Partitioning algorithms Query processing query processing performance R-tree Real time Real-time systems Spatial data Spatial databases Spatial indexes Workload Workload-optimized spatial indexes Workloads |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA4iHvQgPnF9kYNHq2mTNO1RF8WDrCLr4xameaggXdld_f1Okq4uePDitZSm-SYz3yQZviHkyAbaDTqVuGIgE97YDHjJssCuXqlGunjR_nCtBoPq6am-nWv1FWrCkjxwAu6UW-_zqq6AgxEFiAY9AkzF0VNBeRNTI6bquc1UjMFVXtZSdTJDOatPz_p9nBFuCAt5EjS_xKxNVkdFUbG_a7HyKy5HsrlcI6tdlkjP0t-tkwXXbpCVOe3ATXJ_EcUfkDNoqqOL1-U0lQ-7CX18nb5QaCkGgHQEiN-7y4Zj52jsdURvkPzeQiVc-0zDkfnbCOxki9xfXgz7V1nXIyEzvMynGYBgGKGcyUFJsJhdMGkEt8jCDF0RpOVl7V0jyqKojKmsN2VulGwAAGHyfJsstqPW7RDqRMMs8IIJBcJaA84JC5iu4BeM9KJHjmdw6fckhaHjFoLVOqGrA7q6Q7dHzgOk368GHev4AK2rO-vqv6zbI1vBID_j5UEMSLIe2Z9ZSHdON9EYm0I6yxXb_Y-x98hymE86b9kni9PxhzsgS-Zz-joZH8b19gXCX9jA priority: 102 providerName: Directory of Open Access Journals |
| Title | Efficient Exploratory Searches With an Incremental R-Tree Under Oscillating Workloads |
| URI | https://ieeexplore.ieee.org/document/11043150 https://www.proquest.com/docview/3223977370 https://doaj.org/article/3dff1898a3ac42a4b376ac83153a7fca |
| Volume | 13 |
| WOSCitedRecordID | wos001516410000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8QwDI4AMcDAG3FwoAyMFNImbdrxOB1i4CXEa4vcPAAJ9dDdwchvx0lzgIQYWKqqatLUTvzZjmMTsm887Po8lThjIBFOmwR4wRKPrk7KOrdho_3uTF5clA8P1VU8rB7OwlhrQ_CZPfS3YS_fDPWbd5UdIVQh3nkLfVbKoj2s9eVQ8RUkqlzGzEIpq456_T7-BNqAWX7o03yJaWWsiD4hSX-sqvJLFAd8OVn-58hWyFJUJGmv5fwqmbHNGln8kV5wndwOQn4IbEnbULuwo07bCGM7pvfPkycKDUUZ0XoJsb_r5GZkLQ3lkOgl4uOLD5ZrHqn3qr8MwYw3yO3J4KZ_msQyConmRTpJAARDIWZ1CjIHgwoIy7XgBoGa4WqF3PCicrYWRZaVWpfG6SLVMq8BAMnq-CaZa4aN3SLUipoZ4BkTEoQxGqwVBlCjwR507kSHHEzJq17bbBkqWBmsUi03lOeGitzokGPPgq9Xfarr8ABpq-LKUdw4l5ZVCRy0yEDUKBJBl0htDtJp6JANz4_v70VWdEh3ylEV1-VYofjyGi-XbPuPZjtkwQ-x9bJ0ydxk9GZ3ybx-nzyPR3vBZMfr-cdgL0y_T4-I144 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB5VtFLLoU-qLlDqQ48NOLEdJ0dYgUDdbqtqablZEz9aJJRFuwu_n7HjhUpVD71FUewk89kz4_H4G4CPLprdyFNJIwYLGawrUNS8iNY1aN0pnzbaf0z0dNpcXLTf8mH1dBbGe5-Sz_x-vEx7-W5ub2Ko7IBMFdm7uEJ_rKSs-HBc6z6kEmtItEpnbqGStweH4zH9Bq0CK7Ufib7kujZWtj-Jpj_XVflLGScLc_LiP7_tJTzPriQ7HLB_BY98_xo2_yAYfAPnx4khglqyIdku7amzIcfYL9nPy9Vvhj0jLTHECam_78Vs4T1LBZHYV7KQVzFdrv_FYlz9ao5uuQXnJ8ez8WmRCykUVtTlqkCUnNSYtyVqhY5cEK6sFI5MNaf5isqJug2-k3VVNdY2Lti6tFp1iEhiDeItbPTz3r8D5mXHHYqKS43SOYveS4fk01APVgU5gk9r8ZrrgS_DpHUGb82AholomIzGCI4iBPePRrLrdINka_LcMcKFUDZtgwKtrFB2pBTRNiRtgTpYHMFWxOPhfRmKEeyuETV5Zi4NKbDo8wrNt__R7AM8PZ19mZjJ2fTzDjyLnzvEXHZhY7W48e_hib1dXS4Xe2n43QHA49iv |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Exploratory+Searches+With+an+Incremental+R-Tree+Under+Oscillating+Workloads&rft.jtitle=IEEE+access&rft.au=Kalay%2C+Mustafa+Utku&rft.date=2025&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=13&rft.spage=106916&rft.epage=106931&rft_id=info:doi/10.1109%2FACCESS.2025.3581403&rft.externalDocID=11043150 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon |