Reductive data cube based on formal concept analysis

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 46, Issue 11, 2009, Pages 1956-1962

  Shi, Zhibin ^a   Huang, Houkuan ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Aggregation; Concept lattice; Data cube; Formal concept analysis; Reduction

Indexed keywords

BASE TABLE; CONCEPT LATTICES; DATA CUBE; EFFICIENT METHOD; FORMAL CONCEPT ANALYSIS; FORMAL CONCEPT LATTICES; QUERY ANSWERING; REAL WORLD DATA; SPACE SAVINGS;

EQUIVALENCE CLASSES; FLUORINE CONTAINING POLYMERS; GEOMETRY; SET THEORY;

DATA REDUCTION;

EID: 71949123424     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Gray J, Bosworth A, Layman A, et al. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals[C] //Proc of the 12th Int Conf on Data Engineering. Los Alamitos, CA: IEEE Computer Society, 1996: 152-159
2. Harinarayan V, Rajaraman A, Ullman J. Implementing data cubes efficiently[C] //Proc of the ACM SIGMOD Int Conf on Management of Data. New York: ACM, 1996: 205-216
3. Gupta H, Mumick I. Selection of views to materialize under a maintenance cost constraint[G] //LNCS 1540: Proc of the 7th Int Conf on Database Theory. Berlin: Springer, 1999: 453-470
4. Lee M, Hammer J. Speeding up materialized view selection in data warehouses using a randomized algorithm[J]. Int Journal of Cooperative Information Systems, 2001, 10(3): 327-353
5. Jagadish H, Madar J, Ng R. Semantic compression and pattern extraction with fascicles[C] //Proc of the 25th Int Conf on Very Large Data Bases. San Francisco: Morgan Kaufmann, 1999: 186-198
6. Acharya S, Gibbons P, Poosala V, et al. The aqua approximate query answering system[C] //Proc of the ACM SIGMOD Int Conf on Management of data. New York: ACM, 1999: 574-576
7. Vitter J, Wang M. Approximate computation of multidimensional aggregates of sparse data using wavelets[C] //Proc of the ACM SIGMOD Int Conf on Management of data. New York: ACM, 1999: 193-204
8. Wang W, Lu H, Feng J, et al. Condensed cube: An effective approach to reducing data cube size[C] //Proc of the 18th Int Conf on Data Engineering. Los Alamitos, CA: IEEE Computer Society, 2002: 155-165
9. Lakshmanan L, Pei J, Han J. Quotient cube: How to summarize the semantics of a data cube[C] //Proc of the 23rd Int Conf on Very Large Data Bases. San Francisco: Morgan Kaufmann, 2002: 778-789
10. Lakshmanan L, Pei J, Zhao Y. QC-trees: An efficient summary structure for semantic OLAP[C] //Proc of the ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2003: 64-75
11. Sismanis Y, Deligiannakis A, Roussopoulos N, et al. Dwarf: Shrinking the PetaCube[C] //Proc of the ACM SIGM Int Conf on Management of Data. New York: ACM, 2002: 464-475
12. Ganter B, Wille R. Formal Concept Analysis:Mathematical Foundations[M]. Berlin: Springer, 1999
13. Hu Xuegang. The research of knowledge model extraction from database[D]. Hefei: Hefei University of Technology, 2000 (in Chinese)
14. Qu Kaishe, Zhai Yanhui. Posets, inclusion degree theory and FCA[J]. Chinese Journal of Computers, 2006, 29(2): 219-226 (in Chinese)
15. Hahn C, Warren S, London J. Edited synoptic cloud reports from ships and land stations over the globe[DB/OL]. 1994 [2003-10-01]. http: //cdiac.esd.Ornl.gov/cdiac/ndps/ndp026b.html