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.
This paper quantifies the value of pronunciation lexicons in large vocabulary continuous speech recognition (LVCSR) systems that support keyword search (KWS) in low resource languages. State-of-the-art LVCSR and KWS systems are developed for conversational telephone speech in Tagalog, and the baseline lexicon is
With the development of keyword search over relational databases, how to improve the result quality is a popular problem. To solve it, existing work mainly are CN-based and graph-based. The CN-based approaches occupy little memory space and have high level of abstract. However, the defect of these approaches is not
With the popularity of XML technology and Native XML database, efficiently indexing, and retrieving XML data in Native XML database become a important research topic. This paper proposes a keyword-based query solution for Native XML database. An inverted index for XML documents in Native XML database is constructed
Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions have been proposed and many prototypes have been developed. Building on this rapid progress and on growing user needs, recently several RDBMS
capabilities to the data users? To solve these problems, we propose two attribute-based keyword search and data access control schemes based on public-key searchable encryption and attribute based encryption. Our solutions allow a data owner to control the access policy and grant the search policy to any data user who wants to
For low-resource languages, keyword search (KWS) remains challenging due to the lack of training data. This work aims to bolster KWS performance in low-resource languages by incorporating word burst information into the decision process. We find that this information can improve performance when we focus analysis on
This paper surveys research on enabling keyword search in relational databases. We present fundamental characteristics and discuss research dimensions, including data representation, ranking, efficient processing, query representation, and result presentation. Various approaches for developing the search system are
This paper presents a revised method for keyword search from handwritten digital ink in comparison with the previous system. We adopt a search method using noise reduction. Experiments on digital ink databases show that the revised method typically improves the systempsilas overall accuracy (f-measure) from 0.653 to
Keyword search in relational database is a central topic in integrating database and information technologies. We briefly introduce the problem, analyze the challenges, and survey the existing work. We also highlight our research progress of the SPARK project that partially addresses the challenges. A few future
With the growing popularity of XML and emergence of streaming data model, processing streaming XML has become an important topic. This paper proposes keyword search solution over XML fragment streams based on hole-filler model. Two efficient indexes, dual list and sketch are developed to further improve the
Various approaches for keyword search in different settings (e.g., relational databases and XML) actually deal with the problem of enumerating K-fragments. For a given set of keywords K, a K-fragment is a subtree T of the given data graph, such that T contains all the keywords of K and no proper subtree of T has this
interest for people so in this paper an easy approach of gathering and analyzing data through keyword based search in social networks is examined using NodeXL and data is gathered from twitter in which political trends have been analyzed. As a result it will be analyzed that, what people are focusing most in politics.
warrant can be provided. However, sometimes, the investigators need to keep the investigation subject confidential due to the confidentiality of the crime or the server administrator may be one of the suspects. In this paper, we address how to solve this problem by multiple keyword search over encrypted data, so that the
encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are
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
In pursuing the development of Yanii, a novel keyword based search system on graph structures, in this paper we present the computational complexity study of the approach, highlighting a comparative study with actual PTIME state-of-the-art solutions. The comparative study focuses on a theoretical analysis of different
Path and Keyword search in XML documents has recently become an active area of research, in which constructing an effective index is a key issue. Existing index structures and encoding schemes for XML query processing target the Parent-Child and Ancestor-Descendant relationships, however, they depend on large index
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
The paper describes a new approach for querying relational databases through keyword search by exploting Information Retrieval (IR) techniques. When users do not know the structures and the content, keyword search becomes the only efficient and effective solution for allowing people exploring a relational database
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.