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
A new adaptive sorting algorithm is introduced. The new implementation relies on using the traditional AVL trees, and has the same performance limitations. ... We introduce a new adaptive sorting algorithm that uses AVL trees . ... The space utilized by our algorithm is Other methods that use AVL trees to implement adaptive sorting algorithms include the algorithm of Mehlhorn  , and the finger trees of Tsakalidis  . ...doi:10.1007/1-4020-8141-3_25 dblp:conf/ifipTCS/Elmasry04 fatcat:tuzkt4zt4vhk7klrmpu2wlhcfq
Experimental results illustrate that adaptive AVL sort consumes the fewest number of comparisons unless the number of inversions is less than 1%; in such case Splaysort consumes the fewest number of comparisons ... Another interesting result is that although the number of cache misses for the cache-optimal Greedysort algorithm was the least, compared to other adaptive sorting algorithms under investigation, it was ... ADAPTIVE AVL SORT Basic Algorithm AVL sort [Elmasry 2004 ] works by repeatedly inserting the elements into AVL trees. The AVL trees are organized into a list of consecutive bands from left to right. ...doi:10.1145/1412228.1455267 fatcat:wph56emfabaqtbpkwc3f4k6eoi
The authors study a relaxed balancing scheme in AVL trees. The idea is to delay rebalancing operations to help concurrency control of the tree. ... They have demonstrated a need to develop tools for the construction of sorting algorithms that are adaptive with respect to large classes of measures. ...
Lecture Notes in Computer Science
are mostly used with disk-based indexing), and T trees [Lehman and Carey 1986] (which evolved from AVL trees and B trees and are commonly used with main memory indexing). ... -A braided AVL tree is a data structure that combines the properties of both AVL trees and double-linked lists [Rice 2007] . ...doi:10.1007/978-3-319-08608-8_1 fatcat:eq3fkndh3bgwhhhadhg52qgnju
Journal of Computers
In fact, Red Green Black trees can provide better performances in environment where the restructuring is most frequent with Red Black trees. ... This paper propose an extended form of Red Black trees. It presents a new explicit balancing algorithm called Red Green Black trees. ... They are also used to implement task schedulers as interval trees and priority search trees. Binary Search Trees sort tasks automatically for the scheduler without the need to re-sort them. ...doi:10.17706/jcp.13.4.461-470 fatcat:4fh6diom5ng7xcwh2svibiuf3m
The triggering, planning, and cost evaluation of adaptation takes place within a scheduler. ... Scheduling overhead is a major limiting factor for implementing dynamic scheduling algorithms with high frequency timer-tick resolution in real time systems. ... Adaptable Binary Search Trees Although this paper is primarily concerned with deployment of data structure functionality in hardware to achieve real-time properties, we report here on our recent efforts ...doi:10.1016/j.procs.2012.04.129 fatcat:a4zz3tyquberxlczg7hilgb2sq
TSTL is currently available for Python, but easily adapted to other languages as well. ... Lines 30 and 31 provide for initialization of AVL trees, either with the constructor for an empty tree or the constructor that takes a list and produces an AVL tree containing all elements in the list. ... The first of these checks that the AVL tree in question satisfies the AVL guarantee that a tree will be balanced. ...doi:10.1145/2771783.2784769 dblp:conf/issta/GrocePAM15 fatcat:xenfem7asjd3zbnuw4ewawolym
The VLDB journal
A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism ... Our design adapts to the fact that an adaptive index is refined continuously and exploits any concurrency opportunities in a dynamic way. ... As with database cracking, this merge logic takes place as a side effect of query execution. In adaptive merging using partitioned B-trees, a run in the sort logic equals a partition in the B-tree. ...doi:10.1007/s00778-013-0345-7 fatcat:lyhrcbdfqzhibfyuwfjedeujsa
Our scheme provides higher security than OPES and allows for range and point queries to be efficiently evaluated over encrypted numeric data, with decryption performed at the client side. ... At the same time, to be efficiently managed, outsourced data should be indexed, and even adaptively so, as a side-effect of query processing. ... Figure 2 : 2 Encrypted Vector Figure 3 : 3 Encrypted Vector with Ambiguity Figure 4 : 4 Finding a piece in an encrypted AVL Tree Consider the example encrypted AVL tree in Figure 4. ...doi:10.1145/2882903.2882932 dblp:conf/sigmod/KarrasNSBAI16 fatcat:ttlebxi4gfhuhfoxoapkifygji
suffix AVL tree. ... Here we investigate the potential of suitably adapted binary search trees as competitors in this context. ...
Similarly, the corresponding ciphertexts for c + f , f + e will be inserted into another AVL-Tree rooted with c + e. Moreover, f + a will be inserted to a new AVL-Tree rooted with f + a. ... That is, the first OOC centered at b + d corresponds to an AVL-Tree rooted with Enc(b + d); another OOC centered at c + e corresponds to another AVL-Tree rooted with Enc(c + e) (as shown in Fig. 5 ). ... The input of RO is Enc(p i + p j ), and the output is a random number with λ bits. ...arXiv:2002.07511v2 fatcat:peifvlmbgrhpxi3od773sxdv3e
A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism ... Our design adapts to the fact that an adaptive index is refined continuously, and exploits any concurrency opportunities in a dynamic way. ... In adaptive merging, the first query with a predicate against a given column produces sorted runs. ...arXiv:1203.6405v1 fatcat:36d44ujj6nfatmk6qdhgqa5qru
A detailed experimental analysis demonstrates that (a) adaptive indexing maintains its adaptive properties even when running concurrent queries, (b) adaptive indexing can exploit the opportunity for parallelism ... Our design adapts to the fact that an adaptive index is refined continuously, and exploits any concurrency opportunities in a dynamic way. ... In adaptive merging, the first query with a predicate against a given column produces sorted runs. ...doi:10.14778/2180912.2180918 fatcat:bnw2pruxubatthhlk3qnzxg4em
shortest paths, AVL trees, binary heaps, and dynamic arrays. ... We analyze several classic algorithms in our models and develop low-energy variations: comparison sort, insertion sort, counting sort, breadth-first search, Bellman-Ford, Floyd-Warshall, matrix all-pairs ... We employ a reversible AVL tree, with actions carefully specified so as to keep them reversible. ...doi:10.1145/2840728.2840756 dblp:conf/innovations/DemaineLMT16 fatcat:i6r45uh5cfflje2d7hye2f7ic4
By paying a small loss of fitting quality compared with complete reconstruction, we achieve more than one order of magnitude speedup in the update of BVHs. ... We propose the use of balanced trees for storing BVHs, as well as novel algorithms for dynamically restructuring them in the presence of progressive or instantaneous fracture. ... We initialize the AVL tree (i.e. the BVH) by top-down successive sorting and splitting of the input triangle mesh  . ...doi:10.1109/vr.2007.352467 dblp:conf/vr/OtaduyCSG07 fatcat:zniwvqs4n5gjlfedpapxr5cgg4
« Previous Showing results 1 — 15 out of 997 results