The New Jersey Data Reduction Report

An arrangement is shown for controlling transmission of blocks of information to and from a plurality of major components of a digital computer system interconnected by common buses. The disclosed arrangement operates so that any component of the system may normally seize, on a nonpriority basis, one of the buses at the beginning of any time slot defined by two successive clock pulses generated by a single source and applied to all components simultaneously; however, if a special instruction is encountered during execution of a program, any component may retain a bus for more than one time slot. The disclosed arrangement also permits error checking of transmitted information from a given major component without interfering with transmission from any other major component and automatically causes retransmission of any block of information found to be improperly transmitted originally. Still further, the disclosed arrangement permits buses to be dedicated during execution of a program or, if desired, any complete major component to be replaced without affecting any other major component.

[1]  W. Deming,et al.  On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known , 1940 .

[2]  W. Hoeffding.  A Class of Statistics with Asymptotically Normal Distribution , 1948 .

[3]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[4]  M. W. Birch.  Maximum Likelihood in Three-Way Contingency Tables , 1963 .

[5]  Solomon Kullback,et al.  Approximating discrete probability distributions , 1969, IEEE Trans. Inf. Theory.

[6]  R. Bayer,et al.  Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[7]  J. L. Clutter,et al.  Ranked Set Sampling Theory with Order Statistics Background , 1972 .

[8]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[9]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[10]  Stephen E. Fienberg,et al.  Discrete Multivariate Analysis: Theory and Practice , 1976 .

[11]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[12]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[13]  J. Leeuw,et al.  Principal component analysis of three-mode data by means of alternating least squares algorithms , 1980 .

[14]  Robert Kooi,et al.  The Optimization of Queries in Relational Databases , 1980 .

[15]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[16]  Michel Scholl,et al.  New file organization based on dynamic hashing , 1981, TODS.

[17]  P. Glynn.  Asymptotic Theory for Nonparametric Confidence Intervals. , 1982 .

[18]  Olli Nevalainen,et al.  An Algorithm for Unbiased Random Sampling , 1982, Comput. J..

[19]  Gregory Piatetsky-Shapiro,et al.  Accurate estimation of the number of tuples satisfying a condition , 1984, SIGMOD '84.

[20]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[21]  Hong Wang,et al.  Recursive estimation and time-series analysis , 1986, IEEE Trans. Acoust. Speech Signal Process..

[22]  Doron Rotem,et al.  Simple Random Sampling from Relational Databases , 1986, VLDB.

[23]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[24]  Wen-Chi Hou,et al.  Statistical estimators for relational algebra expressions , 1988, PODS '88.

[25]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[26]  David J. DeWitt,et al.  Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries , 1988, SIGMOD Conference.

[27]  T. Sager,et al.  Characterization of a Ranked-Set Sample with Application to Estimating Distribution Functions , 1988 .

[28]  Michael V. Mannino,et al.  Statistical profile estimation in database systems , 1988, CSUR.

[29]  F. M. Malvestuto.  Computing the maximum-entropy extension of given discrete probability distributions , 1989 .

[30]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[31]  Doron Rotem,et al.  Random Sampling from B+ Trees , 1989, VLDB.

[32]  Wen-Chi Hou,et al.  Processing aggregate relational queries with hard time constraints , 1989, SIGMOD '89.

[33]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[34]  Jeffrey F. Naughton,et al.  On Estimating the Size of Projections , 1990, ICDT.

[35]  J. Rao,et al.  On estimating distribution functions and quantiles from survey data using auxiliary information , 1990 .

[36]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[37]  Jeffrey F. Naughton,et al.  Practical selectivity estimation through adaptive sampling , 1990, SIGMOD '90.

[38]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[39]  H. V. Jagadish,et al.  Linear clustering of objects with multiple attributes , 1990, SIGMOD '90.

[40]  Ping Xu,et al.  Random sampling from hash files , 1990, SIGMOD '90.

[41]  Dan E. Willard,et al.  Optimal sample cost residues for differential database batch query problems , 1991, JACM.

[42]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[43]  Kaizheng Du,et al.  On Estimating COUNT, SUM, and AVERAGE Relational Algebra Queries , 1991 .

[44]  Wen-Chi Hou,et al.  Error-constrained COUNT query evaluation in relational databases , 1991, SIGMOD '91.

[45]  Francesco M. Malvestuto,et al.  Approximating discrete probability distributions with decomposable models , 1991, IEEE Trans. Syst. Man Cybern..

[46]  Jeffrey F. Naughton,et al.  Sampling Issues in Parallel Database Systems , 1992, EDBT.

[47]  Ingrid Daubechies,et al.  Ten Lectures on Wavelets , 1992 .

[48]  Michael W. Berry,et al.  Large-Scale Sparse Singular Value Computations , 1992 .

[49]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[50]  F. Olken,et al.  Maintenance of materialized views of sampling queries , 1992, [1992] Eighth International Conference on Data Engineering.

[51]  Gennady Antoshenkov,et al.  Random Sampling from Pseudo-Ranked B+ Trees , 1992, VLDB.

[52]  Jason Catlett,et al.  Peepholing: Choosing Attributes Efficiently for Megainduction , 1992, ML.

[53]  Peter J. Haas,et al.  Sequential sampling procedures for query size estimation , 1992, SIGMOD '92.

[54]  Susan T. Dumais,et al.  Personalized information delivery: an analysis of information filtering methods , 1992, CACM.

[55]  Chris Adie.  Distributed Multimedia Information Systems , 1993, Comput. Networks ISDN Syst..

[56]  G. Antoshenkov,et al.  Dynamic query optimization in Rdb/VMS , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[57]  Susan T. Dumais,et al.  Latent Semantic Indexing (LSI) and TREC-2 , 1993, TREC.

[58]  A. Kuk.  A kernel method for estimating finite population distribution functions using auxiliary information , 1993 .

[59]  Jaideep Srivastava,et al.  Algorithms for loading parallel grid files , 1993, SIGMOD Conference.

[60]  Frank Olken,et al.  Random Sampling from Databases , 1993 .

[61]  Jeffrey F. Naughton,et al.  Efficient Sampling Strategies for Relational Database Operations , 1993, Theor. Comput. Sci..

[62]  Yannis E. Ioannidis,et al.  Universality of Serial Histograms , 1993, VLDB.

[63]  Kevin D. Seppi,et al.  A Bayesian Approach to Database Query Optimization , 1993, INFORMS J. Comput..

[64]  Stavros Christodoulakis,et al.  Optimal histograms for limiting worst-case error propagation in the size of join results , 1993, TODS.

[65]  Richard E. Crandall,et al.  Projects in scientific computation , 1994 .

[66]  Heikki Mannila,et al.  The power of sampling in knowledge discovery , 1994, PODS '94.

[67]  Nick Roussopoulos,et al.  Adaptive selectivity estimation using query feedback , 1994, SIGMOD '94.

[68]  R. Ng,et al.  Eecient and Eeective Clustering Methods for Spatial Data Mining , 1994 .

[69]  Yannis E. Ioannidis,et al.  Balancing histogram optimality and practicality for query result size estimation , 1995, SIGMOD '95.

[70]  Histogram-Based Solutions to Diverse Database Estimation Problems , 1995, IEEE Data Eng. Bull..

[71]  Kuansan Wang,et al.  Spectral shape analysis in the central auditory system , 1995, IEEE Trans. Speech Audio Process..

[72]  Jeffrey F. Naughton,et al.  Generalized Search Trees for Database Systems , 1995, VLDB.

[73]  Hans-Peter Kriegel,et al.  Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification , 1995, SSD.

[74]  Jeffrey F. Naughton,et al.  Sampling-Based Estimation of the Number of Distinct Values of an Attribute , 1995, VLDB.

[75]  Christos Faloutsos,et al.  FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.

[76]  Yannis E. Ioannidis,et al.  Estimation of Query-Result Distribution and its Application in Parallel-Join Load Balancing , 1996, VLDB.

[77]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[78]  Peter J. Haas,et al.  Improved histograms for selectivity estimation of range predicates , 1996, SIGMOD '96.

[79]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[80]  Christos Faloutsos,et al.  Searching Multimedia Databases by Content , 1996, Advances in Database Systems.

[81]  Peter J. Haas,et al.  Hoeffding inequalities for join-selectivity estimation and online aggregation , 1996 .

[82]  Jeffrey F. Naughton,et al.  Selectivity and Cost Estimation for Joins Based on Random Sampling , 1996, J. Comput. Syst. Sci..

[83]  Yossi Matias,et al.  Bifocal sampling for skew-resistant join size estimation , 1996, SIGMOD '96.

[84]  Christos H. Papadimitriou,et al.  On the analysis of indexing schemes , 1997, PODS '97.

[85]  Helen J. Wang,et al.  Online aggregation , 1997, SIGMOD '97.

[86]  Christos Faloutsos,et al.  Efficiently supporting ad hoc queries in large datasets of time sequences , 1997, SIGMOD '97.

[87]  Peter J. Haas,et al.  Large-sample and deterministic confidence intervals for online aggregation , 1997, Proceedings. Ninth International Conference on Scientific and Statistical Database Management (Cat. No.97TB100150).

[88]  Yannis E. Ioannidis,et al.  Selectivity Estimation Without the Attribute Value Independence Assumption , 1997, VLDB.

[89]  Jiong Yang,et al.  STING: A Statistical Information Grid Approach to Spatial Data Mining , 1997, VLDB.

[90]  Carl-Erik Särndal,et al.  Model Assisted Survey Sampling , 1997 .

[91]  P. Haas,et al.  Estimating the Number of Classes in a Finite Population , 1998 .

[92]  Paul M. Aoki.  Generalizing "search" in generalized search trees , 1998, Proceedings 14th International Conference on Data Engineering.

[93]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[94]  Daniel Barbará,et al.  Quasi-Cubes: A Space-E cient Way to Support Approximate Multidimensional Databases , 1998 .