Title :
Using constraints for distributed query processing
Author_Institution :
Dept. of Comput. Sci., Sookmyung Womens Univ., Seoul, South Korea
Abstract :
Constraints are combined with join operations to minimize the amount of data transmission required for distributed query processing. We identify and exploit two important concepts: reducers and abstractors. A constraint can serve as a reducer if it is a sufficient and/or necessary condition for a query. Through replacing a distributed query by a reducer, the query is converted to be processed only at the local site. This converted query, however, requires “compensation” if the constraint is not a necessarily sufficient condition of the query. Although the compensation of the converted query is typically of database tuples, it can also be of the form of abstraction. This paper also shows that a constraint serves as an abstractor to produce a cooperative answer
Keywords :
constraint handling; distributed databases; query processing; relational databases; abstraction; abstractors; compensation; converted query; cooperative answer; database tuples; distributed query processing; join operations; reducers; Computer science; Constraint optimization; Data communication; Distributed databases; Heuristic algorithms; Query processing; Relational databases;
Conference_Titel :
Computer Software and Applications Conference, 1995. COMPSAC 95. Proceedings., Nineteenth Annual International
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-7119-X
DOI :
10.1109/CMPSAC.1995.524770