Query translation on the fly in Deep Web integration

Abstract

Abstract:To facilitate users to access the desired information, many researches have dedicated to the Deep Web (i.e. Web databases) integration. We focus on query translation which is an important part of the Deep Web integration. Our aim is to construct automatically a set of constraints mapping rules so that the system can translate the query from the integrated interface to the Web database interfaces based on them. In this paper, we construct a concept hierarchy for the attributes of the query interfaces, especially, store the synonyms and the types (e.g. IntroductionIn recent years, users could access the interesting information from Deep Web (i.e. Web databases) which has been developed rapidly. As reported [1] , there are 96,000 web sites and 550 billion hidden pages in the Deep Web, which is 500 times more than the Surface Web. To help the users find the desired information from the Deep Web, many researchers carried out their research works on the Deep Web integration. But these researches mainly focus on interface integration and result page extraction, some of which address the Web databases crawling, discovery and classification. A few efforts are dedicated to query translation which has responsibility for translating a user's query from the integrated interface to the web database interfaces.Research works related to query translation have mainly fallen into two categories: attribute mapping and constraints mapping.Attribute mapping [2,3,4,5,6,7] in Deep Web integration has been extensively researched. These works can be classified into two different methods, one [2,3] is schema-based method, and the other [4,5] is instance-based method. The paper [2] takes a conceptually novel approach by viewing schema matching as correlation mining and proposed a new correlation measure, H-measure, to find the mapping attributes. The paper [3] utilizes statistics technology other than data mining one. The paper [4] proposes an interactive, clustering-based approach and the paper [5] proposes a data-ensemble framework with sampling and voting techniques, respectively. Instance-based methods have been employed in many schema matching tasks [6,7]. The paper [6] addresses two significant schema matching problems: intra-site and inter-site. WebIQ [7] proposes a solution that learns from both the Surface Web and the Deep Web to automatically discover instances for interface attributes. Representational research works on constraints mapping are [8] and [9]. The paper [8] applies user provided mapping rules to translate query. In the paper [9], the approach dynamically mapping predicates across unseen sources is proposed.Due to the autonomous, heterogeneous, dynamic and scalable nature of the Deep Web, query translation will be a

Web Database Sampling Based on Dependency of Keywords

“…However, this sampling method requires improvement in many respects, such as the sampling independence, the flexibility of the parameters configuration and the integrity of the results that reflect the database content [13][14][15] In addition, these random sampling methods cannot ensure consistency between the sampling data and the WDB data, such as the consistency of keywords in text attributes, the consistency of numeric distribution in numerical attributes and the integrity of text attributes. Moreover, these methods do not consider the dependencies among attributes in the WDB.…”

Microstructure of diamond/aluminum composites fabricated by pressureless metal infiltration

“…It was shown that the selected species of monocrystalline synthetic diamonds could be well dispersed in a pure aluminum-matrix. However, some ''microngrade'' diamond powders were particularly susceptible to the degradation during composite processing [6][7][8][9][10]. Natishan et al suggested that interfacial reaction in diamond/aluminum composites could be successfully suppressed by using a solid-state route, but the thermal conductivity was not addressed in this study [11].…”