Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: query reformulation

Sortuj według:

Ogranicz wyniki do:

Schema mapping and query reformulation in peer-to-peer XML data integration system

Pankowski T.

Control and Cybernetics

2009

Vol. 38, no 1

173-192

In the paper we discuss the problem of XML data integration in a P2P environment. In this setting each peer stores schema of its local data, mappings between the schema and schemas of some other peers (peer's partners), and schema constraints. The goal of the integration is to answer the queries formulated against arbitrarily chosen peers. The answer consists of data stored in the queried peer as well as data of its direct and indirect partners. We focus on denning and using mappings, schema constraints, and query reformulation in such scenario. We discuss a strategy that allows us to obtain a complete answer with the possibility of discovering missing values. The method is the theoretical foundation of the implementation of SixP2P system (Semantic Integration of XML data in P2P environment).

Guided local search for query reformulation using weight propagation

Moghrabi I.

International Journal of Applied Mathematics and Computer Science

2006

Vol. 16, no 4

537-549

A new technique for query reformulation that assesses the relevance of retrieved documents using weight propagation is proposed. The technique uses a Guided Local Search (GLS) in conjunction with the latent semantic indexing model (to semantically cluster documents together) and Lexical Matching (LM). The GLS algorithm is used to construct a minimum spanning tree that is later employed in the reformulation process. The computations done for Singular Value Decomposition (SVD), LM and the minimum spanning tree are necessary overheads that occur only initially and all subsequent work is based on them. Our experimental results reveal the effectiveness of the new technique.