Digital Access to Comparison-Based Tree Data Structures and Algorithms

@article{Roura2001DigitalAT,
  title={Digital Access to Comparison-Based Tree Data Structures and Algorithms},
  author={Salvador Roura},
  journal={J. Algorithms},
  year={2001},
  volume={40},
  pages={1-23}
}
  • S. Roura
  • Published 23 July 2001
  • Computer Science
  • J. Algorithms
This paper presents a simple method of building tree data structures, which only requires visiting O(log N) nodes and comparing O(D) digits per search or update, where N is the number of keys and D is the length of the keys. These bounds hold independently of the order of the updates and of the digits of the keys. The additional space required by the method is asymptotically dismissable when compared to the space used by the keys and pointers. The proposed method applies either to fixed-length… 
On the number of string lookups in BSTs (and related algorithms) with digital access
TLDR
The number of string lookups in so-augmented BSTs, quicksort and quickselect is haracterized analytically and a variant proposed in this paper is proposed to reduce further the number ofstring lookups.
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that
The number of bit comparisons used by Quicksort: an average-case analysis
TLDR
The prospect of a fair comparison between algorithms of the two types is introduced by providing an averagecase analysis of the number of bit comparisons required by Quicksort, and a new algorithm, "BitsQuick", that reduces this factor to constant order by eliminating needless bit comparisons.
A General Technique for Managing Strings in Comparison-Driven Data Structures
This paper presents a general technique for optimally transforming any dynamic data structure \(\mathcal{D}\) that operates on atomic and indivisible keys by constant-time comparisons, into a data
Combining digital access and parallel partition for quicksort and quickselect
TLDR
This paper combines digital access to strings with parallel partition to enhance parallel quicksort and quickselect implementations and presents broadly the approach, not only algorithmically but from the design and implementation point of view.
Parallelization of Modified Merge Sort Algorithm
TLDR
The claim is that the parallelization of the sorting method is faster and beneficial for multi-core systems and is compared to other sorting methods like quick sort, heap sort, and merge sort to show potential efficiency.
Multikey Quickselect
TLDR
A binary variant of the multikey quickselect algorithm is derived, which is more efficient when the range of values for the alphabet is known, and can be applied to multikesy quicksort.
Parallel Fast Sort Algorithm for Secure Multiparty Computation
TLDR
Results of the experimental tests confirm the effectiveness of the proposed flexible division of tasks between logical processors and show that this proposition is a valuable method that can find many practical applications in high performance computing.
Fully Flexible Parallel Merge Sort for Multicore Architectures
TLDR
A fully flexible sorting method designed for parallel processing based on modified merge sort that can be implemented for a number of processors and shows that with each newly added processor sorting becomes faster and more efficient.
Benchmark Tests on Improved Merge for Big Data Processing
TLDR
There is need to improve sorting methods applied for big data computation as the computer architectures are more efficient with each release and the software is more complex with each version.
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
Fast algorithms for sorting and searching strings
TLDR
This work presents theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings, and presents extensions to more complex string problems, such as partial-match searching.
Suffix arrays: a new method for on-line string searches
TLDR
A new and conceptually simple data structure, called a suffixarray, for on-line string searches is introduced in this paper, and it is believed that suffixarrays will prove to be better in practice than suffixtrees for many applications.
Randomized binary search trees
TLDR
All search and update operations have guaranteed expected cost O(log n), but now irrespective of any assumption on the input distribution.
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
PATRICIA is an algorithm which provides a flexible means of storing, indexing, and retrieving information in a large file, which is economical of index space and of reindexing time. It does not
The string B-tree: a new data structure for string search in external memory and its applications
TLDR
This work introduces a new text-indexing data structure, the String B-Tree, that can be seen as a link between some traditional external-memory and string-matching data structures that is made more effective by adding extra pointers to speed up search and update operations.
Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems
TLDR
A clean structure based on balanced binary search trees is introduced, which is called multidimensional balancedbinary search trees, to represent the set of d -tuples to test for MEMBERSHIP efficiently.
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
We describe a general paradigm for maintaining multidimensional keys in linked data structures designed for one-dimensional keys. We improve existing bounds and achieve new results in a simple way,
Algorithms in C
TLDR
Algorithms in C is a comprehensive repository of algorithms, complete with code, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms.
Trie memory
TLDR
In this paper several paradigms of trie memory are described and compared with other memory paradigm, their advantages and disadvantages are examined in detail, and applications are discussed.
A dichromatic framework for balanced trees
  • L. Guibas, R. Sedgewick
  • Computer Science
    19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
  • 1978
TLDR
This paper shows how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf.
...
1
2
...