SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Distributed and Parallel Databases

Volumn 1, Issue 1, 1993, Pages 9-32

Optimization of parallel query execution plans in XPRS

(2) Hong, Wei a Stonebraker, Michael a

a UNIVERSITY OF CALIFORNIA (United States)

Author keywords

database machines; parallel database systems; query optimization; query processing

Indexed keywords

OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; QUERY LANGUAGES;

PARALLEL DATABASE SYSTEMS; QUERY OPTIMIZATION; QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 0027224684 PISSN: 09268782 EISSN: 15737578 Source Type: Journal
DOI: 10.1007/BF01277518 Document Type: Article

Times cited : (58)

References (22)

1
- 84936511672
- A. Bhide and M. Stonebraker, “A performance comparision of two architectures for fast transaction processing,” in Proc. 1988 IEEE Data Engineering Conf.

2
- 84936511673
- D. Bitton, et al., “Benchmarking database systems: A systematic approach,” in Proc. 1983 VLDB Conf.

3
- 84936511666
- M. Blasgen, et al., “The convoy phenomenon,”Oper. Syst. Rev. vol. 13, no. 2, 1979.

4
- 84936511667
- G. Bultzingsloewen, “Optimizing SQL queries for parallel execution,”SIGMOD Rec. vol. 18, no. 4, 1989.

5
- 84936511676
- G. Copeland, et al., “Data placement in Bubba,” in Proc. 1988 ACM-SIGMOD conf.

6
- 84936511678
- D. Cornell and P. Yu, “Integration of buffer manegement and query optimization in relation database environment,” in Proc. 1989 VLDB Conf.

7
- 84936511679
- D. DeWitt, et al., “GAMMA: A high performance dataflow database machine,” in Proc. 1986 VLDB Conf.

8
- 84936511680
- G. Graefe and K. Ward, “Dynamic query evaluation plans,” in Proc. 1989 ACM-SIGMOD Conf.

9
- 84936511681
- W. Hong, “Exploiting inter-operation parellelism in XPRS,” in Proc. 1992 ACM-SIGMOD Conf.

10
- 84936511682
- R. Katz, and W. Hong, “Performance implications of disk arrays to shared memory database machines,” to appear in Distributed Parallel Databases, 1992.

11
- 84936511683
- L. Mackert, et al., “Index scans using a finite LRU buffer: A validated I/O model,”ACM-TODS, Sept. 1989.

12
- 84936511684
- M. Murphy and D. Rotem, “Processor scheduling for multiprocessor joins,” in Proc. 1989 IEEE Data Engineering Conf.

13
- 84936511685
- M. Murphy and M. Shan, “Execution plan balancing,” in Proc. 1991 IEEE Data Engineering Conf.

14
- 84936511677
- D. Patterson, et al., “RAID: Reduntant arrays of inexpensive disks,” in Proc. 1988 ACM-SIGMOD Conf.

15
- 84936511596
- J. Richardson, et al., “Design and evaluation of parallel pipelined join algorithms,” in Proc. 1987 ACM-SIGMOD Conf.

16
- 84936511597
- D. Schneider and D. DeWitt, “A performance evaluation of four parellel join algorithms in a shared nothing environment,” in Proc. 1989 ACM-SIGMOD Conf.

17
- 84936511593
- D. Schneider and D. DeWitt, “Tradeoffs in processing complex join queries via hashing in multiprocessor database machines,” in Proc. 1990 VLDB Conf.

18
- 84936511592
- P. Selinger, et al., “Access path selection in a relational data base system,” in Proc. 1979 ACM-SIGMOD Conf.

19
- 84936511595
- L. Shapiro, “Join processing in database systems with large main memories,”ACM-TODS, Sept. 1986.

20
- 84936511594
- M. Stonebraker, “The case for shared nothing,” in Proc. 1986 IEEE Data Engineering Conf.

21
- 84936511589
- M. Stonebraker, et al., “The design of XPRS,” in Proc. 1988 VLDB Conf.

22
- 84936511588
- H. Zeller and J. Gray, “An adaptive hash join algorithm for multiuser environments,” in Proc. 1990 VLDB Conf.

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