Proceedings Article10.1109/HICSS.1995.375555
Multidatabase global query optimization
P. Ram,W. Perrizo +1 more
- 04 Jan 1995
- Vol. 3, pp 253-262
TL;DR: The need for a domain translation table in multidatabase query processing is identified, and methods of implementing it are discussed, and four methods by which multid atabase global queries can be processed are introduced and analytically compared.
read more
Abstract: Data requests to multidatabases are posed through non-procedural languages such as SQL and, for a global data request, optimization must be performed to achieve good system performance. However, the issues are often complicated in multidatabases, due to additional issues arising because of the autonomy and heterogeneity restrictions of the independent local DBMSs. The data translation problem between various local systems can be observed at the schema level and at the instance level. We have identified the need for a domain translation table in multidatabase query processing, and we discuss methods of implementing it. Some observations about multidatabase inter-site joins are made, and four methods by which multidatabase global queries can be processed are introduced and analytically compared. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A query processing method for data warehouses which contain multimedia
William Perrizo,Z. Zhang,Stephen Krebsbach +2 more
- 01 Apr 1997
TL;DR: It is shown how Domain Vectors can be used to handle typical queries found in MDW environment and how they are more flexible compared with BitMap index in that they may be extended to handle larger domains and even more importantly show great promise in the area of lnstantiation-On-Demand.
4
Distributed query processing using active networks
Zhili Zhang,William Perrizo +1 more
- 19 Mar 2000
TL;DR: This paper compares transmission delay with latency and shows why design strategies for query processing should be re-examined based on this comparison and shows that active networking can reduce the bandwidth requirement for distributed query meta-data processing by an order of magnitude compared to that of non-active processing.
3
Strategies for implementing distributed query algorithms over high-speed, bandwidth-on-demand, wide area networks
W. Perrizo,Z. Zhang,S. Krebsbach +2 more
- 11 Aug 1997
TL;DR: The authors propose a set of strategies designed to help the implementers of distributed query algorithms on high speed, bandwidth-on-demand, wide area networks and develop a distributed join algorithm that exhibits near optimal performance.
1
References
•Proceedings Article
Proceedings of the 48th Hawaii International Conference on System Sciences
Arjan J. Knol,Marijn Janssen,Henk Sol +2 more
- 01 Jan 2015
1.5K
Implementation techniques for main memory database systems
David J. DeWitt,Randy H. Katz,Frank Olken,Leonard D. Shapiro,Michael Stonebraker,Darien Wood +5 more
- 01 Jun 1984
TL;DR: This paper considers the changes necessary to permit a relational database system to take advantage of large amounts of main memory, and evaluates AVL vs B+-tree access methods, hash-based query processing strategies vs sort-merge, and study recovery issues when most or all of the database fits in main memory.
•Book
Distributed Databases: Principles and Systems
Stefano Ceri,Giuseppe Pelagatti +1 more
- 01 Jan 1984
TL;DR: It is necessary to consider the architecture of the distributed database as a system of principles rather than as a black-box of values.
809
A federated architecture for information management
Dennis Heimbigner,Dennis McLeod +1 more
TL;DR: An approach to the coordinated sharing and interchange of computerized information is described emphasizing partial, controlled sharing among autonomous databases.
661
Related Papers (5)
Archana Kumari,Vikram Singh +1 more
- 01 Jan 2017
Chiang Lee,Chia-Jung Chen,Hongjun Lu +2 more
- 01 Sep 1995