Parallelizing Computations of Full Disjunctions
- 1 September 2019
- journal article
- research article
- Published by Elsevier in Big Data Research
- Vol. 17, 18-31
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An Algorithm for kth Minimum Spanning TreeElectronic Notes in Discrete Mathematics, 2016
- Providing Insight into Data Source TopicsJournal on Data Semantics, 2016
- Parallel data processing with MapReduceACM SIGMOD Record, 2012
- MAP-JOIN-REDUCE: Toward Scalable and Efficient Data Analysis on Large ClustersIEEE Transactions on Knowledge and Data Engineering, 2010
- Scatter-Gather-Merge: An efficient star-join query processing algorithm for data-parallel frameworksCluster Computing, 2010
- An incremental algorithm for computing ranked full disjunctionsJournal of Computer and System Sciences, 2007
- Parallel query processing with zigzag treesThe VLDB Journal, 1993
- The Gamma database machine projectIEEE Transactions on Knowledge and Data Engineering, 1990
- On the foundations of the universal relation modelACM Transactions on Database Systems, 1984
- Finding All Spanning Trees of Directed and Undirected GraphsSIAM Journal on Computing, 1978