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.
Consider an information repository whose content is categorized. A data item (in the repository) can belong to multiple categories and new data is continuously added to the system. In this paper, we describe a system, CS*, which takes a keyword query and returns the relevant top-K categories. In contrast, traditional
Keyword search is familiar to general users as the most popular information retrieval method, especially for searching on the Web because of its user-friendly way. In recent years various approaches to free-form keyword search over RDBMS have been proposed. They can produce results across multiple tuples in different
more accurately and simply. RDF is a language for representing metadata. An enormous number of keywords on the semantic Web are very important to make practical applications of the semantic Web because most users prefer to search with keywords. In this paper, we classify queries with keyword conditions into three patterns
Search engines on the Web have popularized the keyword-based search paradigm, while searching in databases users need to know a database schema and a query language. Keyword search techniques on the Web cannot directly be applied to databases because the data on the Internet and database are in different forms. So
encrypting digital goods maybe not work well if buyers and sellers trade with the digital goods in this environment. The reason is that the cloud server could not decide which digital goods contain certain keywords requested by a buyer if the meta data of the encrypted digital goods is not searchable. In this paper, we propose
Metacat to improve metadata search in multiple ways: (i) by expanding standard keyword searches with ontology term hierarchies; (ii) by allowing keyword searches to be applied to annotations in addition to traditional meta-data; and (iii) by allowing more structured searches over annotations via ontology terms. We describe
system provides an easy-to-use query interface, built upon semantic technologies where users can freely store and query their metadata. Going beyond basic keyword search, the system provides a variety of advanced functionalities tailored for sensor metadata search; ordering search results according to our ranking mechanism
This paper addresses the problem of integrating speech and text content sources for the document search problem, as well as its usefulness from an ad-hoc retrieval -keyword search - point of view. Position specific posterior latices (PSPL) is naturally extended to deal with both speech and text content, where a new
Structured P2P systems can locate a resource by the unique identifier of the resource using distributed hash table. So users must know the identifier of a resource exactly to retrieve the resource in such systems. In addition, because of the variety and complexity of resources, a resource can not be described exactly and integrally only with an identifier, but needs multiple properties. Using metadata...
Nowadays, we have to deal with a large quantity of unstructured, heterogeneous data, produced by an increasing number of sources. Clustering heterogeneous data is essential to getting structured information in response to user queries. In this paper, we assess the results of a new clustering technique - clustering by compression - when applied to metadata associated with heterogeneous sets of data...
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.