Dynamic Sort-Based Parallelism
作者： David E. Walrath , Kurt Deschler , Steven A. Kirk
DOI:
关键词:
摘要: A system, method, and computer program product are provided for sorting a set of records in sort run. As the sorted, metadata regarding run is gathered, subsequently used to determine bounds two or more disjoint subsets This enables parallelization several tasks over data using efficient, dynamic determination, such as outputting sorted from parallel.
google.de 参考文章(23)
Ying Xu, Venkatesh Ganti, Probabilistic techniques for detecting duplicate tuples ,(2005)
Mohammed Zait, Cetin Ozbutin, Alexander Channing Ho, Benoit Dageville, Method and mechanism for retrieving values from a database ,(1998)
Gregory Dorman, Andrew Witkowski, David Greenfield, Using relational structures to create and support a cube within a relational database system ,(2003)
Masahiko Nagata, Masataka Matsuura, Seishi Okamoto, Hiroya Hayashi, Tatsuya Asai, Computer program, device, and method for sorting dataset records into groups according to frequent tree ,(2005)
Berkant Barla Cambazoglu, Vassilis Plachouras, Flavio Junqueira, Shirish Tatikonda, Posting list intersection parallelism in query processing ,(2009)
James Alan Ruddy, Curt Lee Cotner, Peephole DBMS reorganization allowing concurrent data manipulation ,(2005)
Honesty C. Young, Raymond A. Lorie, Method for sorting using approximate key distribution in a distributed system ,(1992)
Ching-Tien Ho, Rakesh Agrawal, Mohammed J. Zaki, Parallel classification for data mining in a shared-memory multiprocessor system ,(1998)
Mihnea Andrei, Sudipto R. Chowdhuri, System and Methodology for Parallel Query Optimization Using Semantic-Based Partitioning ,(2005)
Anthony Lowell Rollins, Brian Don Tate, Timothy Edward Miller, Miriam H. Herman, Todd Michael Brye, Data mining assists in a relational database management system ,(1999)