Method for computing frequency distribution for many fields in one pass in parallel
作者： Jerry Lee Callen , Michael James Beckerle
DOI:
关键词: Algorithm 、 Identifier 、 Statistics 、 Computer science 、 Value (computer science) 、 Frequency distribution 、 Table (database) 、 Set (abstract data type) 、 Distribution (mathematics) 、 Sorting 、 Field (computer science)
摘要: Provided are a techniques for determining frequency distribution set of records. A count table distributions is built in memory each field the records, wherein record includes identifier, value, and number times value occurs identifier concatenated with comprises composite key value. It determined that at least one approaching maximum amount allocated to table. The records sent sorting additional counting, include values.
lens.org 参考文章(12)
Bhashyam Ramesh, Olli Pekka Kostamaa, Statistical representation of skewed data ,(2003)
Brian C. Edem, Richard P. Helliwell, John T. Johnston, Stable sorting for a sort accelerator ,(1989)
Isao Namba, Method and device for sorting data, and a computer product ,(2001)
Michael A. Ekhaus, Method and system for data processing for pattern detection ,(2003)
Gary Graunke, Leonard D. Shapiro, Sujata Ramamoorthy, Parallel merge sort method and apparatus ,(1996)
Michael L. Horowitz, Sort system for merging database entries ,(1999)
Shinji Furusho, Method and apparatus for retrieving accumulating and sorting table formatted data ,(1999)
Ravi Kothuri, Siva Ravada, Jayant Sharma, Jayanta Banerjee, Heirarchical indexing of multi-attribute data by sorting, dividing and storing subsets ,(1999)
Michael L. Horowitz, Sort system for text retrieval ,(2001)
Yong-Sik Yoon, Data search method in key telephone system ,(1998)