.png){kind=icon}
.png){kind=icon}
Return
Query merging: Improving query subscription processing in a multicast environment
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2003.1161589.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces techniques for reducing data dissemination costs of query subscriptions in a multicast environment. The reduction is achieved by merging queries with overlapping, but not necessarily equal, answers. The paper formalizes the query-merging problem and introduces a general framework and cost model for evaluating merging. We prove that the problem is NP-hard and propose exhaustive algorithms and three heuristic algorithms: The Pair Merging Algorithm, the Directed Search Algorithm, and the Clustering Algorithm. We develop a simulator, which uses geographical queries as a representative example for evaluating the different heuristics and show that the performance of our heuristics is close to optimal.
Keywords:
query processing
data dissemination
query merging
query subscriptions
query result multicast
geographical queries
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W
Organization
No organization information available