Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/28659.28668acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free access

Answering queries in categorical databases

Published: 01 June 1987 Publication History
  • Get Citation Alerts
  • Abstract

    A compatible categorical data base can be viewed as a single (contingency) table by taking the maximum-entropy extension of the component tables. Such a view, here called universal table model, is needed to answer a user who wishes “cross-classified” categorical data, that is, categorical data resulting from the combination of the information contents of two or more base tables. In order to implement a universal table interface we make use of a query-optimization procedure, which is able to generate an appropriate answer both in the case that the asked data are present in the data base and in the case that they are not and, then, have to be estimated

    References

    [1]
    A H Andersen, Multidimensional contfngency tables, Scand J Stat 1 (1974) 115-127
    [2]
    C Been et al, On the desirab~llty of acycl~c data base schemes, J ACM 30 (1983) 479-513
    [3]
    C Berge, Graphs and hypergraphs NORTH HOLLAND, 1973
    [4]
    Y B~shop et al, Discrete multtvar~ate analysis theory and practice MIT PRESS, 1978
    [5]
    J N Darroch, interaction models, Encyclopedia of statistical sciences, 4 (1983) 182-187
    [6]
    J N Darroch et al, Markov fields and Iog-I~near interaction models for contingency tables, The Ann of Statist 8 3 (1980) 522-539
    [7]
    L A Goodman, The multivariate analysis of qualltatwe data fnteract~ons among multiple class~ficatJons, J Amer Stat Assoc 65 (1970) 226-256
    [8]
    L A Goodman, Part~t~onfng of ch~-square, analys~s of marginal contingency tables and estimation of extected frequencies ~n mult~dzmensfonal conttngency tables, J Amer Statist Assoc 66 (1971 ) 339-344
    [9]
    S J Haberman, The general log-linear model Ph D thes~s Dept Statist UnMv Chtcago 1970
    [10]
    S J Haberman, The analysis of frequency data Un Chicago PRESS, 1974
    [11]
    E T Jaynes, Information theory and statistical mechanics I, Phys Rev 106 (1957) 620-630
    [12]
    E T Jaynes, Prior probab~l~tfes, IEEE Trans Syst Sc and Cyb 4 (1958) 227-241
    [13]
    H H Ku et al, interaction ~n multrdJmensJonai contingency tables an ~nformatJon-theoret~c approach, NATIONAL BUREAU OF STANDARDS J of Res Math Scl 72B 3 (1968) 159-199
    [14]
    F M Malvestuto, Statistical treatment of the ~nformat~on content of a data base, Inf Systems 11 3 (1986)
    [15]
    F M Malvestuto, Decomposing complex contingency tables to reduce storage requirements, III Int Workshop on "Statistical and Scientific Database Management", Luxembourg (1986)
    [16]
    F M Malvestuto, Modelling large bases of categoncal data with acycl~c schemes, F~rst Int Conf on "Database Theory", Rome (1986)
    [17]
    J E Shore et al, Axiomatic denvat~on of the pnnc~ple of maxsmum entropy and the pnnc~ple of minimum cross-entropy, IEEE Trans Inf Theory 26 (1980)26-37
    [18]
    A Shoshan~ et al, Stat=stJcal and sc~ent=fic database ~ssues, IEEE Trans Soft Eng 11 (1985) 1040-1047

    Cited By

    View all
    • (2018)Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society: Series B (Methodological)10.1111/j.2517-6161.1988.tb01721.x50:2(157-194)Online publication date: 5-Dec-2018
    • (2014)A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data CubesACM Transactions on Database Systems10.1145/263854539:3(1-31)Online publication date: 7-Oct-2014
    • (2004)Customized answers to summary queries via aggregate viewsProceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.10.1109/SSDM.2004.1311211(193-202)Online publication date: 2004
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODS '87: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
    June 1987
    363 pages
    ISBN:0897912233
    DOI:10.1145/28659
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 June 1987

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    PODS '87
    Sponsor:
    PODS '87: Principles of database systems
    March 23 - 25, 1987
    California, San Diego, USA

    Acceptance Rates

    Overall Acceptance Rate 642 of 2,707 submissions, 24%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)34
    • Downloads (Last 6 weeks)13
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society: Series B (Methodological)10.1111/j.2517-6161.1988.tb01721.x50:2(157-194)Online publication date: 5-Dec-2018
    • (2014)A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data CubesACM Transactions on Database Systems10.1145/263854539:3(1-31)Online publication date: 7-Oct-2014
    • (2004)Customized answers to summary queries via aggregate viewsProceedings. 16th International Conference on Scientific and Statistical Database Management, 2004.10.1109/SSDM.2004.1311211(193-202)Online publication date: 2004
    • (1998)A Fast Algorithm for Query Optimization in Universal-Relation DatabasesJournal of Computer and System Sciences10.1006/jcss.1998.157056:3(299-309)Online publication date: 1-Jun-1998
    • (1993)A universal-scheme approach to statistical databases containing homogeneous summary tablesACM Transactions on Database Systems10.1145/169725.16971218:4(678-708)Online publication date: 1-Dec-1993
    • (1993)ADAMSProceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice10.1145/162754.167188(652-659)Online publication date: 1-Mar-1993
    • (1993)MefistoIEEE Transactions on Knowledge and Data Engineering10.1109/69.2347785:4(670-681)Online publication date: 1-Aug-1993
    • (1992)Approximate query processing with summary tables in statistical databasesAdvances in Database Technology — EDBT '9210.1007/BFb0032451(499-515)Online publication date: 1992
    • (1989)Aggregate evaluability in statistical databasesProceedings of the 15th international conference on Very large data bases10.5555/88830.88877(279-286)Online publication date: 1-Jul-1989

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media