메뉴 건너뛰기




Volumn , Issue , 2003, Pages 163-174

Efficient computation of subqueries in complex OLAP

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE ANALYTICAL PROCESSING; SEQUENTIAL QUERY LANGUAGE;

EID: 0345359221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2003.1260790     Document Type: Conference Paper
Times cited : (19)

References (26)
  • 1
    • 0345637916 scopus 로고    scopus 로고
    • Complex OLAP and distributed data warehousing
    • Ph.D. Thesis. To be published
    • M. O. Akinde. Complex OLAP and distributed data warehousing. Ph.D. Thesis. To be published, 2003.
    • (2003)
    • Akinde, M.O.1
  • 3
    • 84883775660 scopus 로고    scopus 로고
    • Efficient OLAP query processing in distributed data warehouses
    • Prague, Czech Republic, Mar.
    • M. O. Akinde, M. H. Böhlen, T. Johnson, L. V. S. Lakshmanan, and D. Srivastava. Efficient OLAP query processing in distributed data warehouses. In EDBT'2002, pages 336-353, Prague, Czech Republic, Mar. 2002.
    • (2002) EDBT'2002 , pp. 336-353
    • Akinde, M.O.1    Böhlen, M.H.2    Johnson, T.3    Lakshmanan, L.V.S.4    Srivastava, D.5
  • 4
    • 25744474901 scopus 로고    scopus 로고
    • Maintenance and computation of complex aggregate views
    • Master's thesis, Aalborg University, Denmark, June
    • M. O. Akinde and O. G. Jensen. Maintenance and computation of complex aggregate views. Master's thesis, Aalborg University, Denmark, June 1998.
    • (1998)
    • Akinde, M.O.1    Jensen, O.G.2
  • 5
    • 84976804217 scopus 로고
    • Incremental computation of nested relational query expressions
    • June
    • L. Bækgaard and L. Mark. Incremental computation of nested relational query expressions. ACM TODS, 20(2): 111-148, June 1995.
    • (1995) ACM TODS , vol.20 , Issue.2 , pp. 111-148
    • Bækgaard, L.1    Mark, L.2
  • 6
    • 0345206038 scopus 로고
    • Translating and optimizing SQL queries having aggregates
    • Brighton, England, UK, Sept.
    • G. v. Bültingsloewen. Translating and optimizing SQL queries having aggregates. In VLDB'87, pages 235-243, Brighton, England, UK, Sept. 1987.
    • (1987) VLDB'87 , pp. 235-243
    • Bültingsloewen, G.V.1
  • 7
    • 0030671986 scopus 로고    scopus 로고
    • Subquery elimination: A complete unnesting algorithm for an extended relational algebra
    • Birmingham, U.K., Apr.
    • P. Celis and H. Zeller. Subquery elimination: A complete unnesting algorithm for an extended relational algebra. In ICDE'97, page 321, Birmingham, U.K., Apr. 1997.
    • (1997) ICDE'97 , pp. 321
    • Celis, P.1    Zeller, H.2
  • 8
    • 0022044255 scopus 로고
    • Translating SQL into relational algebra: Optimization, semantics, and equivalence of SQL queries
    • Apr.
    • S. Ceri and G. Gottlob. Translating SQL into relational algebra: Optimization, semantics, and equivalence of SQL queries. IEEE TSE, 11(4):324-345, Apr. 1985.
    • (1985) IEEE TSE , vol.11 , Issue.4 , pp. 324-345
    • Ceri, S.1    Gottlob, G.2
  • 9
    • 53949096328 scopus 로고    scopus 로고
    • Evaluation of ad hoc olap: In-place computation
    • Cleveland, Ohio, USA, July
    • D. Chatziantoniou. Evaluation of ad hoc olap: In-place computation. In SSDBM'99, pages 34-43, Cleveland, Ohio, USA, July 1999.
    • (1999) SSDBM'99 , pp. 34-43
    • Chatziantoniou, D.1
  • 10
    • 0034999147 scopus 로고    scopus 로고
    • MD-join: An operator for complex OLAP
    • Heidelberg, Germany, Apr.
    • D. Chatziantoniou, M. O. Akinde, T. Johnson, and S. Kim. MD-join: an operator for complex OLAP. In ICDE'2001, pages 524-533, Heidelberg, Germany, Apr. 2001.
    • (2001) ICDE'2001 , pp. 524-533
    • Chatziantoniou, D.1    Akinde, M.O.2    Johnson, T.3    Kim, S.4
  • 11
    • 84994128851 scopus 로고    scopus 로고
    • Groupwise processing of relational queries
    • Athens, Greece, Aug.
    • D. Chatziantoniou and K. A. Ross. Groupwise processing of relational queries. In VLDB'97, pages 476-485, Athens, Greece, Aug. 1997.
    • (1997) VLDB'97 , pp. 476-485
    • Chatziantoniou, D.1    Ross, K.A.2
  • 12
    • 0344775408 scopus 로고
    • Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers
    • Brighton, England, Sept.
    • U. Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In VLDB'87, pages 197-208, Brighton, England, Sept. 1987.
    • (1987) VLDB'87 , pp. 197-208
    • Dayal, U.1
  • 13
    • 0032094141 scopus 로고    scopus 로고
    • Query unnesting in object-oriented databases
    • Seattle, Washington, USA, June
    • L. Fegaras. Query unnesting in object-oriented databases. In SIGMOD'98, Seattle, Washington, USA, June 1998.
    • (1998) SIGMOD'98 , pp. 49-60
    • Fegaras, L.1
  • 14
    • 0345637914 scopus 로고    scopus 로고
    • Orthogonal optimization of subqueries and aggregation
    • Santa Barbara, California, USA, May
    • C. A. Galindo-Legaria and M. M. Joshi. Orthogonal optimization of subqueries and aggregation. In VLDB'2001, Santa Barbara, California, USA, May 2001.
    • (2001) VLDB'2001
    • Galindo-Legaria, C.A.1    Joshi, M.M.2
  • 15
    • 84976738309 scopus 로고
    • Optimization of nested SQL queries revisited
    • San Francisco, California, USA, May
    • R. A. Ganski and H. K. T. Wong. Optimization of nested SQL queries revisited. In SIGMOD'87, pages 23-33, San Francisco, California, USA, May 1987.
    • (1987) SIGMOD'87 , pp. 23-33
    • Ganski, R.A.1    Wong, H.K.T.2
  • 16
    • 0029752925 scopus 로고    scopus 로고
    • Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total
    • New Orleans, Louisiana, USA, Feb.
    • J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In ICDE'96, pages 152-159, New Orleans, Louisiana, USA, Feb. 1996.
    • (1996) ICDE'96 , pp. 152-159
    • Gray, J.1    Bosworth, A.2    Layman, A.3    Pirahesh, H.4
  • 17
    • 0020182801 scopus 로고
    • On optimizing an SQL-like nested query
    • Sept.
    • W. Kim, On optimizing an SQL-like nested query. ACM TODS, 7(3):443-469, Sept. 1982.
    • (1982) ACM TODS , vol.7 , Issue.3 , pp. 443-469
    • Kim, W.1
  • 18
    • 0030382425 scopus 로고    scopus 로고
    • Processing OODB queries by O-algebra
    • Rockville, Maryland, USA, Nov.
    • J. Lin and Z. M. Özsoyoglu. Processing OODB queries by O-algebra. In CIKM'96, pages 134-142, Rockville, Maryland, USA, Nov. 1996.
    • (1996) CIKM'96 , pp. 134-142
    • Lin, J.1    Özsoyoglu, Z.M.2
  • 19
    • 0024719831 scopus 로고
    • Optimization and dataflow algorithms for nested tree queries
    • Amsterdam, Holland, Aug.
    • M. Muralikrishna. Optimization and dataflow algorithms for nested tree queries. In VLDB'89, pages 77-85, Amsterdam, Holland, Aug. 1989.
    • (1989) VLDB'89 , pp. 77-85
    • Muralikrishna, M.1
  • 20
    • 0002448463 scopus 로고
    • Improved unnesting algorithms for join aggregate SQL queries
    • Vancouver, British Columbia, Canada, Aug.
    • M. Muralikrishna. Improved unnesting algorithms for join aggregate SQL queries. In VLDB'92, pages 91-102, Vancouver, British Columbia, Canada, Aug. 1992.
    • (1992) VLDB'92 , pp. 91-102
    • Muralikrishna, M.1
  • 21
    • 0025593744 scopus 로고
    • Translation with optimization from relational calculus to relational algebra having aggregate functions
    • Dec.
    • R. Nakano. Translation with optimization from relational calculus to relational algebra having aggregate functions. ACM TODS, 15(4):518-557, Dec. 1990.
    • (1990) ACM TODS , vol.15 , Issue.4 , pp. 518-557
    • Nakano, R.1
  • 22
    • 84976862905 scopus 로고
    • Extensible/rule based query rewrite optimization in starburst
    • San Diego, California, USA, June
    • H. Pirahesh, J. M. Hellerstein, and W. Hasan. Extensible/rule based query rewrite optimization in starburst. In SIGMOD'92, pages 39-48, San Diego, California, USA, June 1992.
    • (1992) SIGMOD'92 , pp. 39-48
    • Pirahesh, H.1    Hellerstein, J.M.2    Hasan, W.3
  • 23
    • 0032094512 scopus 로고    scopus 로고
    • Reusing invariants: A new strategy for correlated queries
    • Seattle, Washington, USA, June
    • J. Rao and K. A. Ross. Reusing invariants: A new strategy for correlated queries. In SIGMOD'98, pages 37-48, Seattle, Washington, USA, June 1998.
    • (1998) SIGMOD'98 , pp. 37-48
    • Rao, J.1    Ross, K.A.2
  • 24
    • 0029733593 scopus 로고    scopus 로고
    • Complex query decorrelation
    • New Orleans, Louisiana, USA, Feb.
    • P. Seshadri, H. Pirahesh, and T. Y. C. Leung. Complex query decorrelation. In ICDE'96, pages 450-458, New Orleans, Louisiana, USA, Feb. 1996.
    • (1996) ICDE'96 , pp. 450-458
    • Seshadri, P.1    Pirahesh, H.2    Leung, T.Y.C.3
  • 26
    • 0039049508 scopus 로고    scopus 로고
    • Algebraic unnesting of nested object queries
    • Technical Report CSE-99-013, Oregon Graduate Institute
    • Q. Wang, D. Maier, and L. Shapiro. Algebraic unnesting of nested object queries. Technical Report CSE-99-013, Oregon Graduate Institute, 1999.
    • (1999)
    • Wang, Q.1    Maier, D.2    Shapiro, L.3


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