메뉴 건너뛰기




Volumn 25, Issue 2, 1996, Pages 91-102

Optimizing Queries over Multimedia Repositories

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; RELATIONAL DATABASE SYSTEMS;

EID: 0030156967     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/235968.233323     Document Type: Article
Times cited : (61)

References (23)
  • 1
    • 0029706597 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • th ACM Symposium on Principles of Database Systems, June
    • th ACM Symposium on Principles of Database Systems, June 1996. Also available as IBM Almaden Research Center Technical Report RJ 9980.
    • (1996) IBM Almaden Research Center Technical Report RJ 9980
    • Fagin, R.1
  • 2
    • 1842459998 scopus 로고    scopus 로고
    • Optimizing queries over multimedia repositories
    • Hewlett-Packard Laboratories, March
    • Surajit Chaudhuri and Luis Gravano. Optimizing queries over multimedia repositories. Technical report, Hewlett-Packard Laboratories, March 1996. Also available as ftp://db.stanford.edu/pub/gravano/-1996/sigmod.ps.
    • (1996) Technical Report
    • Chaudhuri, S.1    Gravano, L.2
  • 3
    • 85033769079 scopus 로고
    • Retrieval of multimedia documents by imprecise query specification
    • Venice, Italy, March
    • F. Rabitti. Retrieval of multimedia documents by imprecise query specification. In Proceedings of the 1990 EDBT, Venice, Italy, March 1990.
    • (1990) Proceedings of the 1990 EDBT
    • Rabitti, F.1
  • 6
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • June
    • Antonin Guttman. R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD Conference, pages 47-57, June 1984.
    • (1984) Proceedings of the 1984 ACM SIGMOD Conference , pp. 47-57
    • Guttman, A.1
  • 17
    • 0025558190 scopus 로고
    • Extensible database management systems
    • December
    • M. Carey and L. Haas. Extensible database management systems. ACM SIGMOD Record, December 1990.
    • (1990) ACM SIGMOD Record
    • Carey, M.1    Haas, L.2
  • 18
    • 0028445008 scopus 로고
    • Optimizing disjunctive queries with expensive predicates
    • A. Kemper, G. Moerkotte, and K. Peithner. Optimizing disjunctive queries with expensive predicates. SIGMOD record, 23(2):336, 1994.
    • (1994) SIGMOD Record , vol.23 , Issue.2 , pp. 336
    • Kemper, A.1    Moerkotte, G.2    Peithner, K.3
  • 19
    • 0025590871 scopus 로고
    • Finding heuristics for processing selection queries in relational database systems
    • M.T. Ozsu and D. Meechan. Finding heuristics for processing selection queries in relational database systems. Information Systems, 15(3), 1990.
    • (1990) Information Systems , vol.15 , Issue.3
    • Ozsu, M.T.1    Meechan, D.2
  • 20
    • 84976765396 scopus 로고
    • An architecture for query optimization
    • Orlando, FL, June
    • A. Rosenthal and D. Reiner. An architecture for query optimization. In Proc. ACM SIGMOD Conf., page 246, Orlando, FL, June 1982.
    • (1982) Proc. ACM SIGMOD Conf. , pp. 246
    • Rosenthal, A.1    Reiner, D.2
  • 21
    • 0002508352 scopus 로고
    • Single table access using multiple indexes: Optimization, execution and concurrency control techniques
    • Also published in/as: IBM Almaden Res.Ctr, Res.R. No.RJ7341, Mar. 1990
    • C. Mohan. Single table access using multiple indexes: Optimization, execution and concurrency control techniques. In EDBT 90, Venice, 1990. Also published in/as: IBM Almaden Res.Ctr, Res.R. No.RJ7341, Mar. 1990, 15pp.
    • (1990) EDBT 90, Venice
    • Mohan, C.1


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