A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Sort-based query-adaptive loading of R-trees
2012
Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12
Preserved Fulltext
Our sort-based algorithms for query-adaptive loading consist of two steps: First, sorting orders are identified resulting in better R-trees than those obtained from standard space-filling curves. ...
Bulk-loading of R-trees has been an important problem in academia and industry for more than twenty years. Current algorithms create R-trees without any information about the expected query profile. ...
We aim to design algorithms for query-adaptive loading R-trees optimized in respect to a given query profile. Here, we focus on sort-based techniques because of their conceptual simplicity. ...
doi:10.1145/2396761.2398577
dblp:conf/cikm/AchakeevSW12
fatcat:xmq7yczp4rcovofmyddi4mc6h4
Sort-based parallel loading of R-trees
2012
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data - BigSpatial '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Widmayer, Sort-Based Qeury Adaptive Loading of R-trees, in CIKM 2012 1. ...
Objective
Rectangles
Queries
Minimal bounding rectangles (MBR)
of R-tree leaf level
Sort-based Query-Adaptive Loading [1]
NP-Hardness of optimal partitioning
Conceptual Easy Heuristic Algorithm ...
Results H: standard sort-based bulk loading, Hilbert-Order H-GO: our approach GOPT, Hilbert-Order
STR: STR loading 4 KB Pages; Queries follow data distribution. ...
doi:10.1145/2447481.2447489
dblp:conf/gis/AchakeevSSS12
fatcat:r4clatnwfra73dpsgzxu5agumy
An efficient algorithm for bulk-loading xBR+-trees
2018
Computer Standards & Interfaces
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
and STR, a popular algorithm of bulk-loading R-trees, regarding tree creation time and the characteristics of the trees created, and second, we experimentally compare the query efficiency of bulk-loaded ...
xBR +trees vs. bulk-loaded R-trees, regarding I/O and execution time. ...
Recently, in [15] a sort-based query-adaptive loading for building R-trees optimally designed for a given query profile is presented. ...
doi:10.1016/j.csi.2017.05.003
fatcat:ankpbkxh4becjgloukzfj2pkee
High-dimensional index structures database support for next decade's applications (tutorial)
1998
Proceedings of the 1998 ACM SIGMOD international conference on Management of data - SIGMOD '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
split history:
54
Speed-Up of X-Tree over the R*-Tree
Point Query
10 NN Query
56
Bulk-Load of X-Trees [BBK 98a]
I Observation:
In order to split a data set, we do not
have to sort it ...
Models for High-Dimensional Query Processing 4. Indexing High-Dimensional Space 4.1 kd-Tree-based Techniques 4.2 R-Tree-based Techniques I Structure of the Directory I Overlapping vs. ...
doi:10.1145/276304.276353
dblp:conf/sigmod/BerchtoldK98
fatcat:pde4px7oxng2xhhclfrkxawmty
Coconut
2018
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
First, traditional bulk-loading algorithms based on sorting cannot be used. ...
We then explore prefix-based and median-based splitting policies for bottom-up bulk-loading, showing that median-based splitting outperforms the state of the art, ensuring that all nodes are densely populated ...
The raw data series are stored in the leaves of the tree. Our R-tree implementation uses the Sort-Tail-Recursive bulk loading algorithm [24] . ...
doi:10.14778/3199517.3199519
fatcat:eliltucsbbge5fpe7iwv7koziy
Coconut: a scalable bottom-up approach for building data series indexes
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
First, traditional bulk-loading algorithms based on sorting cannot be used. ...
We then explore prefix-based and median-based splitting policies for bottom-up bulk-loading, showing that median-based splitting outperforms the state of the art, ensuring that all nodes are densely populated ...
The raw data series are stored in the leaves of the tree. Our R-tree implementation uses the Sort-Tail-Recursive bulk loading algorithm [24] . ...
arXiv:2006.13713v1
fatcat:stt5dnstqberjcb26idtpxb76m
OSM-tree: A Sortedness-Aware Index
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
., via bulk loading in a B+-tree). However, state-of-the-art index designs do not benefit when data is ingested in an order that is close to being sorted but not fully sorted. ...
We apply the proposed design paradigm on a state-of-the-art B+-tree, and we propose the Ordered Sort-Merge tree (OSM-tree). ...
By adaptively sorting buffered data during queries, OSM-tree avoids the burden of sorting large data collections. ...
arXiv:2202.04185v1
fatcat:hsldl2yrpvfgpbdpnibzxjzrv4
A class of R-tree histograms for spatial databases
2012
Proceedings of the 20th International Conference on Advances in Geographic Information Systems - SIGSPATIAL '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a class of spatial histograms derived from the popular family of R-tree indexes. ...
We propose a cost-optimized approach that combines bulk-loading of Rtrees and construction of spatial histograms. ...
The authors would like to thank Eugen Walter, Mareike Stoof and Anne Sophie Knöller for help in implementation and reviewing this piece of work. ...
doi:10.1145/2424321.2424387
dblp:conf/gis/AchakeevS12
fatcat:ir5xy3ilynh5bocrkavhyglndq
LSbM-tree: Re-Enabling Buffer Caching in Data Management for Mixed Reads and Writes
2017
2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
, and providing high bandwidth of disks for range queries. ...
With the help of a small on-disk compaction buffer, LSbM achieves a high query performance by enabling effective buffer caching, while retaining all the merits of LSM-tree for write-intensive data processing ...
Furthermore, those r + 1 blocks will cause the loading of another (r + 1) * (r + 1) blocks when they are being compacted to level i + 2. ...
doi:10.1109/icdcs.2017.70
dblp:conf/icdcs/TengGLCMZZ17
fatcat:d66qnmusq5bdvfs4ryyg4f53r4
DCF: An Efficient Data Stream Clustering Framework for Streaming Applications
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
supporting multidimensional historical queries. ...
Our experimental results show that our approach significantly reduces the number of disk accesses in terms of both inserting and retrieving data. ...
In addition, bulk updating techniques do not address the problem of adapting to load fluctuations, which happens frequently when dealing with stream-based applications. ...
doi:10.1007/11827405_12
fatcat:h5krqd56kbcwbm2sgc3jvvcn4m
Coconut: sortable summarizations for scalable indexes over static and streaming data series
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2006.11474v1 fatcat:dqhjo3qnsbf2njqx3hwwzvbkkm
We then explore prefix-based and median-based splitting policies for bottom-up bulk loading, showing that median-based splitting outperforms the state of the art, ensuring that all nodes are densely populated ...
As a result, Coconut is able to use bulk loading and updating techniques that rely on sorting to quickly build and maintain a contiguous index using large sequential disk I/Os. ...
The raw data series are stored in the leaves of the tree. Our R-tree implementation uses the Sort-Tail-Recursive bulk loading algorithm [32]. ...
arXiv:2006.11474v2
fatcat:552r3xccczgdtffkegwreesjbm
A scalable approach for index in generic location-aware rank query
2021
International Journal of Intelligent Information and Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Finally, the external attribute-based IR-tree sort algorithm is proposed to solve the scalability issues. ...
After that, an efficient method called Multi-IRS is proposed to optimise the query search at runtime. Our analysis points out how optimisation could be done. ...
the attribute-based IR-tree adapted the packing algorithm to guarantee a global optimisation of the objects in the R-Tree instead of using the heuristic method as any R-tree variants do. ...
doi:10.1504/ijiids.2021.112079
fatcat:ulfmkjj6vfbqvngzkljnrlge3e
A Framework for Index Bulk Loading and Dynamization
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider a class of balanced trees that we call weight-balanced partitioning trees (or wp-trees) for indexing a set of points in R d . ...
Using this framework together with a new general construction (bulk loading) technique of independent interest, we obtain data structures with guaranteed good update performance in terms of I/O transfers ...
Once sorted, the points are kept sorted throughout the recursive calls to the Bulk load procedure. ...
doi:10.1007/3-540-48224-5_10
fatcat:k4pdfz3ygfdrjglme6fqjbkira
Adaptive Reorganization of Coherency-Preserving Dissemination Tree for Streaming Data
2006
22nd International Conference on Data Engineering (ICDE'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a cost-based approach to construct dissemination trees to minimize the average loss of fidelity of the system. ...
To adapt to inaccurate statistics, runtime fluctuations of data characteristics, server workloads, and network conditions etc., we propose a runtime adaptive scheme to incrementally transform a dissemination ...
It first sorts the nodes in ascending order of the values of their coherency requirements and then adds them one by one into the tree in the sorted order. ...
doi:10.1109/icde.2006.13
dblp:conf/icde/ZhouOTY06
fatcat:dxxuvwsxbzb5fdsbej5jdswdjy
Dynamic Sorted Neighborhood Indexing for Real-Time Entity Resolution
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Build Phase: In this phase, records are loaded from dataset R, their SKVs are generated, and they are inserted into the BRT. The SKVs become the key values skv used as tree nodes. ...
This approach will only include tree nodes that are sufficiently similar to the records in the query record's tree node.
Similarity-Based Adaptive Window (DySNI-s). ...
doi:10.1007/978-3-319-08608-8_1
fatcat:eq3fkndh3bgwhhhadhg52qgnju
« Previous
Showing results 1 — 15 out of 18,317 results