Multiple Query Optimization with Depth-First Branch-and-Bound and dynamic query ordering
In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., usually a single query gets transformed into a set of closely related database queries. Also, great benefits can be obtained by executing a group of related queries all together...
Saved in:
Main Authors: | LIM, Ee Peng, COSAR, Ahmet, SRIVASTAVA, Jaideep |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1995
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/185 https://ink.library.smu.edu.sg/context/sis_research/article/1184/viewcontent/P1993_4.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
by: COSAR, Ahmet, et al.
Published: (1993) -
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) -
Deque: Querying the deep web
by: SHESTAKOV, Denis, et al.
Published: (2005) -
Querying structured web resources
by: LIM, Ee Peng, et al.
Published: (1998)