Multiple Query Optimization with Depth-First Branch-and-Bound
In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., a single query can be transformed into a set ofclosely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single...
Saved in:
Main Authors: | COSAR, Ahmet, LIM, Ee Peng, SRIVASTAVA, Jaideep |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1993
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/958 https://ink.library.smu.edu.sg/context/sis_research/article/1957/viewcontent/p433_cosar.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Multiple Query Optimization with Depth-First Branch-and-Bound and dynamic query ordering
by: LIM, Ee Peng, et al.
Published: (1995) -
Query optimization and processing in Federated Database Systems
by: LIM, Ee Peng, et al.
Published: (1993) -
Deriving object oriented federated databases and processing federated queries
by: LIM, Ee Peng, et al.
Published: (1998) -
Entity Identification in Database Integration: An Evidential Reasoning Approach
by: LIM, Ee Peng, et al.
Published: (1993) -
An evidential reasoning approach to attribute value conflict resolution in database integration
by: LIM, Ee Peng, et al.
Published: (1996)