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.
Results diversification for keyword search on XML documents has attracted considerable attentions from research community in recent years. Though search results were diversified from different perspectives in the existing methods, the effects were still far away from satisfactory. This paper proposes a new way to
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
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.
A model of the precursors of intention to use in online keyword searching is presented and empirically tested with data collection. Analysis of the data 331 participants, utilizing structural equation model (SEM), supported most of the predictions. Language anxiety, perceived ease of use, perceived usefulness
A solution of a keyword query over graphs is a Group Steiner tree, which is rooted at a node and whose nodes collectively satisfy the query (e.g. node keywords cover all the query keywords), and in which the sum of edge weights satisfies given conditions (e.g., need to be minimum or be the first K minimal among all
Information retrieval techniques play vital role in the era of information technology. Inverted index is one of the technique to retrieve the information/data related with certain keyword. This technique gives faster results to retrieve relevant document from billions of documents, which contains specified keyword. In
There may exist a specific relationship between the keywords if an XML multi-keywords search has more than one answers. Such relationship can be speculated by SLCA. This paper proposes a user-friendly Top-k keywords searching approach based on the relationship of keywords. The SLCA of a keyword search is first
Keyword search in RDBs has been extensively studied in recent years. The existing studies focused on finding all or top-k interconnected tuple-structures that contain keywords. In reality, the number of such interconnected tuple-structures for a keyword query can be large. It becomes very difficult for users to obtain
given to demonstrate scheme has effectiveness. Lastly, we respectively construct a (t, p)–threshold multi-server PIR and secure keyword search protocol, and a (t, p)–threshold incremental secret sharing protocol, both based on the proposed (t, p)–PFSS scheme, and simple analysis the correctness and the
huge irrelevant search hits. In this paper, we propose an improved method for ranking of search results to reduce human efforts on locating interesting hits. The search results are re-ranked using adaptive user interest hierarchies (AUIH), which considers both investigator-defined keywords and user interest learnt from
-processing of Web search results have been extensively studied to help user effectively obtain useful information. This paper has basically three parts. First part is the review study on how the keyword is expanded through truncation or wildcards (which is a little known feature but one of the most powerful one) by using
number of users with diverse characteristics and needs. Currently, many research projects or practical applications have emerged which only support single keyword search, and few of them support semantic retrieval. In this paper, we propose a model of ontology-based semantic information retrieval systems according to hybrid
In this paper we explore the design of Leyline, a provenance-based desktop search and file management system, both on a conceptual and user interface level. We start with a comparative analysis and classification of previous provenance based search systems, examining their underlying assumptions and focus, search coverage and flexibility, as well as features and limitations. We then describe a novel...
types of multimedia user interfaces only for younger persons who can utilize keyword search functions. In this paper, we discuss the user interface switching appropriate for contents according to computer skills and facilities and evaluate them based on a questionnaire survey.
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.