Article

Free access

Fast set operations using treaps

Authors:

Guy E. Blelloch,

Margaret Reid-MillerAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 16 - 26

https://doi.org/10.1145/277651.277660

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

R. J. Andersol#, E. W. Meyer, and M. K. Warmuth. Parallel approximation algorithms for bin packing. Information and Computation, 82:262-277, 1989.

Digital Library

Google Scholar

[2]

A. B~umker and W. Dittrich. Fully dynamic search trees for an extension of the BSP model. In Proceedings of the 8th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 233-242, 1996.

Digital Library

Google Scholar

[3]

G. Blelloch and M. Reid-Miller. Pipelining with flatures. In Proceedings of the 9th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 249-259, June 1997.

Digital Library

Google Scholar

[4]

G. E. Blelloch. Scans as primitive parallel operations. 1538, Nov. 1989.

Digital Library

Google Scholar

[5]

R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of the Fifth A CM SIGPLA N on Principles and Practice of Parallel Programming, pages 207-216, Santa Barbara, CA, July 1995.

Digital Library

Google Scholar

[6]

M. R. Brown and R. E. Tarjan. A fast merging algorithm. Journal of the Association for Computing Machinery, 26(2):211-226, Apr. 1979.

Digital Library

Google Scholar

[7]

M. R. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing, 9(3):594-614, Aug. 1980.

Crossref

Google Scholar

[8]

S. Carlsson, C. Levcopoulos, and O. Petersson. Sublinear merging and natural merge sort. In Proceedings of the International Symposium on Algorithms SIGA L '90, pages 251-260, Tokyo, Japan, Aug. 1990.

Digital Library

Google Scholar

[9]

E. Dekel and I. Azsvath. Parallel external merging. Journal of Parallel and Distributed Computing, 6:623- 635, 1989.

Digital Library

Google Scholar

[10]

J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, Feb. 1989.

Digital Library

Google Scholar

[11]

X. Guan and M. A. Langston. Time-space optimal parallel merging and sorting. IEEE Transactions on Computers, 40:592-602, 1991.

Digital Library

Google Scholar

[12]

T. Hagerup and C. Rfib. Optimal merging and sorting on the gREW PRAM. Information Processing Letters, 33:181-185, 1989.

Digital Library

Google Scholar

[13]

L. Highan and E. Schenk. Maintaining B-tree on an gREW PRAM. Journal of Parallel and Distributed Computing, 22:329-335, 1994.

Digital Library

Google Scholar

[14]

F. K. Hwang and S. Lin. A simple algorithm for merging two disjoint linearly ordered sets. SlAM Journal of Computing, 1:31-39, Mar. 1972.

Crossref

Google Scholar

[15]

J. Katajainen. Efficient parallel algorithms for manipulating sorted sets. P'rvceedings of the 17th Annual Computer Science Conference, Australian Computer Science Communications, 16(1):281-288, 1994.

Google Scholar

[16]

J. Katajainen, C. Levcopoulos, and O. Petersson. Space-efficient parallel merging. In Proceedings of the .#th International PARLE Conference (Parallel Architectures and Languages Europe), volume 605 of Lecture Notes in Computer Science, pages 37-49, 1992.

Digital Library

Google Scholar

[17]

D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley Publishing Company, Reading, MA, 1968.

Google Scholar

[18]

D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley Publishing Company, Reading, MA, 1973.

Google Scholar

[19]

M. L. Mauldin. Lycos: Design choices in an Internet search service. IEEE Expert, 12(1), Jan. 1997. (w w w.compu ter. org/pubs / expert / 1997 / trends / x1008 / mauldin, htm).

Google Scholar

[20]

W. Paul, U. Vishkin, and H. Wagener. Parallel dictionaries on 2-3 trees. In Lecture Notes in Computer Science 143: Proceedings of the lOth Colloquium on Automata, Languages and Programming, Barcelona, Spain, pages 597-609, Be#n/New York, July 1983. Springer-Verlag.

Crossref

Google Scholar

[21]

W. Pugh. A skip list cookbook. Technical Report CS- TR-2286.1, University of Maryland Institute for Advanced Computer Studies Dept. of Computer Science, University of Maryland, June 1990.

Digital Library

Google Scholar

[22]

W. Pugh. Skip lists: A probilistic alternative to balanced #rees. Communications of the A UM, 33(6):668- 676, June 1990.

Digital Library

Google Scholar

[23]

A. Ranade. Maintaining dynamic ordered sets on processor networks, in Proceedings of the 4th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 127-137, San Diego, CA, June-July 1992.

Digital Library

Google Scholar

[24]

M. Reid-Miller. Experiments with Parallel Pointer- Based Algoriths. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1998. To appear.

Google Scholar

[25]

R. Sedgewick. Algorithms in C. Addison-Wesley, Reading, MA, 1990.

Digital Library

Google Scholar

[26]

R. Seidel and C. R. Aragon. Randomized search trees. Algorithrnica, 16:464-497, 1996.

Crossref

Google Scholar

[27]

D. D. Sleator and R. E. Tarjan. Self-adjusting binary trees. Journal of the Association }or Computing Machinery, 32(3):652-686, 1985.

Digital Library

Google Scholar

[28]

Supercomputing Technologies Group, MIT Laboratory for Computer Science. Cilk-5.0 (Beta i) Reference Manual, Mar. 1997.

Google Scholar

[29]

P. J. Varman, B. R. Iyer, D. J. Haderle, and S. M. Dunn. Parallel merging: Algorithm and implementation results. Parallel Computing, 15:165-177, I990.

Crossref

Google Scholar

[30]

I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, 1994.

Digital Library

Google Scholar

Cited By

View all

Blelloch GGu YSun Y(2024)Teaching Parallel Algorithms Using the Binary-Forking Model2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00080(346-351)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00080
Piekenbrock MPerea J(2024)Move schedules: fast persistence computations in coarse dynamic settingsJournal of Applied and Computational Topology10.1007/s41468-023-00156-38:2(301-345)Online publication date: 20-Jan-2024
https://doi.org/10.1007/s41468-023-00156-3
Aksenov VKokorin IMartsenyuk A(2023)Parallel-Batched Interpolation Search TreeParallel Computing Technologies10.1007/978-3-031-41673-6_9(109-125)Online publication date: 15-Aug-2023
https://doi.org/10.1007/978-3-031-41673-6_9
Show More Cited By

Index Terms

Fast set operations using treaps
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Parallel algorithms

Recommendations

Faster and smaller inverted indices with treaps
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

We introduce a new representation of the inverted index that performs faster ranked unions and intersections while using less space. Our index is based on the treap data structure, which allows us to intersect/merge the document identifiers while ...
Hardware Designs for Decimal Floating-Point Addition and Related Operations

Decimal arithmetic is often used in commercial, financial, and Internet-based applications. Due to the growing importance of decimal floating-point (DFP) arithmetic, the IEEE 754 Draft Standard for Floating-Point Arithmetic (IEEE P754) includes ...
The Axiomatization of the Rough Set Upper Approximation Operations

The theory of rough sets deals with the approximation of an arbitrary subset of a universe by two definable or observable subsets called, respectively, the lower and the upper approximation. There are at least two methods for the development of this ...

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

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 ACM 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
1,177
Total Downloads

Downloads (Last 12 months)178
Downloads (Last 6 weeks)20

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Blelloch GGu YSun Y(2024)Teaching Parallel Algorithms Using the Binary-Forking Model2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00080(346-351)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00080
Piekenbrock MPerea J(2024)Move schedules: fast persistence computations in coarse dynamic settingsJournal of Applied and Computational Topology10.1007/s41468-023-00156-38:2(301-345)Online publication date: 20-Jan-2024
https://doi.org/10.1007/s41468-023-00156-3
Aksenov VKokorin IMartsenyuk A(2023)Parallel-Batched Interpolation Search TreeParallel Computing Technologies10.1007/978-3-031-41673-6_9(109-125)Online publication date: 15-Aug-2023
https://doi.org/10.1007/978-3-031-41673-6_9
Blelloch GFerizovic DSun Y(2022)Joinable Parallel Balanced Binary TreesACM Transactions on Parallel Computing10.1145/35127699:2(1-41)Online publication date: 11-Apr-2022
https://dl.acm.org/doi/10.1145/3512769
Shen ZWan ZGu YSun YAgrawal KLee I(2022)Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficientProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538574(273-286)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538574
Gao YWang QCai L(2022)Byzantine Consensus Based on Modified Treap Topology2022 8th International Conference on Systems and Informatics (ICSAI)10.1109/ICSAI57119.2022.10005475(1-5)Online publication date: 10-Dec-2022
https://doi.org/10.1109/ICSAI57119.2022.10005475
Leutgeb LMoser GZuleger F(2022)Automated Expected Amortised Cost Analysis of Probabilistic Data StructuresComputer Aided Verification10.1007/978-3-031-13188-2_4(70-91)Online publication date: 6-Aug-2022
https://doi.org/10.1007/978-3-031-13188-2_4
Dong XGu YSun YZhang YAgrawal KAzar Y(2021)Efficient Stepping Algorithms and Implementations for Parallel Shortest PathsProceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3409964.3461782(184-197)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3409964.3461782
Bulatov KFedotova NArlazarov V(2021)Fast Approximate Modelling of the Next Combination Result for Stopping the Text Recognition in a Video2020 25th International Conference on Pattern Recognition (ICPR)10.1109/ICPR48806.2021.9412574(239-246)Online publication date: 10-Jan-2021
https://doi.org/10.1109/ICPR48806.2021.9412574
Zhang JLu YSpampinato DFranchetti F(2020)FESIA: A Fast and SIMD-Efficient Set Intersection Approach on Modern CPUs2020 IEEE 36th International Conference on Data Engineering (ICDE)10.1109/ICDE48307.2020.00130(1465-1476)Online publication date: May-2020
https://doi.org/10.1109/ICDE48307.2020.00130
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Faster and smaller inverted indices with treaps

Hardware Designs for Decimal Floating-Point Addition and Related Operations

The Axiomatization of the Rough Set Upper Approximation Operations