메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1053-1063

Efficient and scalable statistics gathering for large databases in oracle 11 g

Author keywords

Large databases; Partitioned tables; Sampling; Statistics gathering; Synopses

Indexed keywords

DATABASE SYSTEMS; IMAGE CODING; MANAGEMENT INFORMATION SYSTEMS; PARTITIONS (BUILDING); STATISTICS;

EID: 57149145645     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376721     Document Type: Conference Paper
Times cited : (19)

References (26)
  • 2
    • 0029719644 scopus 로고    scopus 로고
    • The Space Complexity of Approximating the Frequency Moments
    • N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. In STOC, pages 20-29, 1996.
    • (1996) STOC , pp. 20-29
    • Alon, N.1    Matias, Y.2    Szegedy, M.3
  • 5
    • 0033723117 scopus 로고    scopus 로고
    • Towards estimation error guarantees for distinct values
    • M. Charikar, S. Chaudhuri, R. Motwani, and V. R. Narasayya. Towards estimation error guarantees for distinct values. In PODS, pages 268-279, 2000.
    • (2000) PODS , pp. 268-279
    • Charikar, M.1    Chaudhuri, S.2    Motwani, R.3    Narasayya, V.R.4
  • 6
    • 0031353179 scopus 로고    scopus 로고
    • Size-estimation framework with applications to transitive closure and reachability
    • E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J.Comput. Syst. Sci., 55(3):441-453, 1997.
    • (1997) J.Comput. Syst. Sci , vol.55 , Issue.3 , pp. 441-453
    • Cohen, E.1
  • 7
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms for data base applications
    • P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 31 (2): 182-209, 1985.
    • (1985) Journal of Computer and System Sciences , vol.31 , Issue.2 , pp. 182-209
    • Flajolet, P.1    Martin, G.N.2
  • 8
    • 35448945510 scopus 로고    scopus 로고
    • A dip in the reservoir: Maintaining sample synopses of evolving datasets
    • R. Gemulla, W. Lehner, and P. J. Haas. A dip in the reservoir: Maintaining sample synopses of evolving datasets. In VLDB, pages 595-606, 2006.
    • (2006) VLDB , pp. 595-606
    • Gemulla, R.1    Lehner, W.2    Haas, P.J.3
  • 9
    • 35448945249 scopus 로고    scopus 로고
    • Maintaining bernoulli samples over evolving multisets
    • R. Gemulla, W. Lehner, and P. J. Haas. Maintaining bernoulli samples over evolving multisets. In PODS, pages 93-102, 2007.
    • (2007) PODS , pp. 93-102
    • Gemulla, R.1    Lehner, W.2    Haas, P.J.3
  • 10
    • 84944323337 scopus 로고    scopus 로고
    • Distinct sampling for highly-accurate answers to distinct values queries and event reports
    • P. B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, pages 541-550, 2001.
    • (2001) VLDB , pp. 541-550
    • Gibbons, P.B.1
  • 11
    • 0008717161 scopus 로고
    • Sampling-based estimation of the number of distinct values of an attribute
    • P. J. Haas, J. F. Naughton, S. Seshadri, and L. Stokes. Sampling-based estimation of the number of distinct values of an attribute. In VLDB, pages 311-322, 1995.
    • (1995) VLDB , pp. 311-322
    • Haas, P.J.1    Naughton, J.F.2    Seshadri, S.3    Stokes, L.4
  • 12
    • 84976858994 scopus 로고
    • Error-constraint count query evaluation in relational databases
    • W.-C. Hou, G. Ozsoyoglu, and E. Dogdu. Error-constraint count query evaluation in relational databases. In SIGMOD Conference, pages 278-287, 1991.
    • (1991) SIGMOD Conference , pp. 278-287
    • Hou, W.-C.1    Ozsoyoglu, G.2    Dogdu, E.3
  • 13
    • 84976802986 scopus 로고
    • Processing aggregate relational queries with hard time constraints
    • W.-C. Hou, G. Ozsoyoglu, and B. K. Taneja. Processing aggregate relational queries with hard time constraints. In SIGMOD Conference, pages 68-77, 1989.
    • (1989) SIGMOD Conference , pp. 68-77
    • Hou, W.-C.1    Ozsoyoglu, G.2    Taneja, B.K.3
  • 14
    • 57149141214 scopus 로고    scopus 로고
    • IBM. DB2 version 9: Collecting Statistics on a Sample of the Table Data, 2006. http://publib.boulder.ibm.com/infocenter/db21uw/v9/index.jsp?topic=/com. ibm.db2.udb.admin.doc/doc/c0011393.htm.
    • IBM. DB2 version 9: Collecting Statistics on a Sample of the Table Data, 2006. http://publib.boulder.ibm.com/infocenter/db21uw/v9/index.jsp?topic=/com. ibm.db2.udb.admin.doc/doc/c0011393.htm.
  • 15
    • 57149125522 scopus 로고    scopus 로고
    • IBM. DB2 version 9: RUNSTATS Command, 2006. http://publib.boulder.ibm. com/infocenter/db21uw/v9/index.jsp?topic=/com.ibm.db2.ub.admin.doc/doc/r0001980. htm.
    • IBM. DB2 version 9: RUNSTATS Command, 2006. http://publib.boulder.ibm. com/infocenter/db21uw/v9/index.jsp?topic=/com.ibm.db2.ub.admin.doc/doc/r0001980. htm.
  • 18
    • 57149124434 scopus 로고    scopus 로고
    • Oracle. Chapter 18: Partitioned Tables and Indexes. In Oracle Database Concepts, 10g Release 2 (10.2), 2005.
    • Oracle. Chapter 18: Partitioned Tables and Indexes. In Oracle Database Concepts, 10g Release 2 (10.2), 2005.
  • 19
    • 85134435537 scopus 로고    scopus 로고
    • The Making of TPC-DS
    • R. Othayoth and M. Poess. The Making of TPC-DS. In VLDB, 2006.
    • (2006) VLDB
    • Othayoth, R.1    Poess, M.2
  • 22
    • 0039107367 scopus 로고    scopus 로고
    • New TPC Benchmarks for Decision Support and Web Commerce
    • M. Poess and C. Floyd. New TPC Benchmarks for Decision Support and Web Commerce. In ACM SIGMOD RECORD, Vol 29, No 4, 2000.
    • (2000) ACM SIGMOD RECORD , vol.29 , Issue.4
    • Poess, M.1    Floyd, C.2
  • 23
    • 0022821541 scopus 로고
    • Temporal Data Management
    • A. Shoshani and K. Kawagoe. Temporal Data Management. In VLDB, pages 79-88, 1986.
    • (1986) VLDB , pp. 79-88
    • Shoshani, A.1    Kawagoe, K.2
  • 24
    • 3543073535 scopus 로고    scopus 로고
    • MUDD: A Multi-Dimensional Data Generator
    • J. M. Stephens and M. Poess. MUDD: a Multi-Dimensional Data Generator. In WOSP, pages 104-109, 2004.
    • (2004) WOSP , pp. 104-109
    • Stephens, J.M.1    Poess, M.2
  • 26
    • 0025449292 scopus 로고
    • A linear-time probabilistic counting algorithm for database applications
    • K.-Y. Whang, B. T. V. Zanden, and H. M. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Trans. Database Syst., 15(2):208-229, 1990.
    • (1990) ACM Trans. Database Syst , vol.15 , Issue.2 , pp. 208-229
    • Whang, K.-Y.1    Zanden, B.T.V.2    Taylor, H.M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.