Query processing in distributed, taxonomy-based information sources

Details Query processing in distributed, taxonomy-based information sources Query processing in distributed, taxonomy-based information sources

2011-09-12

arxiv.org/abs/1109.2425v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We address the problem of answering queries over a distributed information system, storing objects indexed by terms organized in a taxonomy. The taxonomy consists of subsumption relationships between negation-free DNF formulas on terms and negation-free conjunctions of terms. In the first part of the paper, we consider the centralized case, deriving a hypergraph-based algorithm that is efficient in data complexity. In the second part of the paper, we consider the distributed case, presenting alternative ways implementing the centralized algorithm. These ways descend from two basic criteria: direct vs. query re-writing evaluation, and centralized vs. distributed data or taxonomy allocation. Combinations of these criteria allow to cover a wide spectrum of architectures, ranging from client-server to peer-to-peer. We evaluate the performance of the various architectures by simulation on a network with O(10^4) nodes, and derive final results. An extensive review of the relevant literature is finally included.

Affiliated with

Also associated with

No associations

Rating

Query processing in distributed, taxonomy-based information sources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Query processing in distributed, taxonomy-based information sources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query processing in distributed, taxonomy-based information sources will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59769