The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we focus on efficient keyword query processing for XML data based on the SLCA and ELCA semantics. We propose a novel form of inverted lists for keywords which include IDs of nodes that directly or indirectly contain a given keyword. We propose a family of efficient algorithms that are based on the set
Keyword search is a user-friendly way to query XML data, such that users do not need to understand the complex syntax of structured query languages and the complex structural information of the underlying XML data. However, existing semantics suffer from limited expressiveness, thus users cannot obtain desired
Keyword search on (semi)structured databases is an increasingly popular research topic. But existing techniques do not deal well with the problems presented by the queries that are ambiguous. Recent approaches for RDF databases try to improve the quality of results by introducing an explicit top-k
The field of Information Retrieval plays an important role in searching on the Internet. Most of the information retrieval systems are limited to the query processing based on keywords. In information retrieval system the matching of the query against a set of text record is the core of the system. Retrieval of the
To solve the Chord algorithm of P2P system only supporting single keyword precise query problem, we join the Hilbert curve into the Chord ring to form a new structure-HilbertChord (HC). It is a structure based on the Hilbert curve and Chord system. HC provides a good support for the approximate query. Experiments
The Bloom filter is a data structure which the characteristics of contents is expressed by a bit pattern. The Bloom filter has become attractive as one of the methods of looking up data in the distributed system. Since two or more keywords can be used in the method based on the Bloom filter, it is more flexible than
dictionary, is used to segment the short text questions. From the segmentation results, the keywords are extracted to obtain query target and query requirement of the question and to generate a SQL statement for data query. The method proposed in this paper can be applied to question-answering system based on database.
A Bloom filter offers a simple space-efficient randomized data structure for representing a set in order to support membership queries. The Bloom filter has become attractive as one of the methods of looking up data in the distributed system. Since two or more keywords can be used in the method based on the Bloom
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.