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 presents a code-search method, which includes an algorithm of keyword code-search and a prototype implementation. In this paper, a query is a set of keywords and a search result is a set of execution paths fulfilling the query, that is, each of the execution paths includes all of the keywords. Here, an
Document indexation is an essential task achieved by archivists or automatic indexing tools. To retrieve relevant documents to a query, keywords describing this document have to be carefully chosen. Archivists have to find out the right topic of a document before starting to extract the keywords. For an archivist
(P2P) computing model has fueled the autonomous data sharing over the Internet in a more flexible fashion. Needless to say, XML data retrieval in P2P systems has become attractive to professionals in both research and industrial communities. In this paper, we propose a Bloom-Filter based keyword search framework for XML
between the DHT overlay and the semantic overlay to support the search of a keyword sequence. Its time cost is sublinear with the length of the keyword sequence. Analysis and experiments show that the DST-based search is fast, load-balanced, and useful in realizing an accurate content search on P2P networks.
A lot of semantic information is lost due to keyword centric approach of information indexing. Web search should be based on `context' of the query and not only on the keywords in query. It is only possible when a context from a query as well as document is sensed and which requires a context based indexing approach
As a semi-structured data standard rich in both content and structure, XML is becoming the dominant information organization format in digital library. Compared with traditional information retrieval systems, XML retrieval system has great advantages in organizing and retrieving information due to its element-level rather than document-level access to relevant information. This paper gives a detailed...
following. First, the approximation of the superset relationship among keyword-sets by the descendance relationship among Bloom filters. Second, the use of a summary prefix tree (SPT), a trie indexing data structure, for keyword-based search over DHT. Third, an hybrid lookup procedure which exploits the sparsity of Bloom
important role to help communicate cloud computing system components. Tree based data structures are also used as index to perform the search faster. Currently most of the cloud providers use the keyword based search. Multi-attribute search optimizes the search process and also performs the search faster. The paper proposes a
data as searching keyword. In this paper we have developed an efficient search suggestion generator using Phonetic algorithm namely, Double Metaphone Algorithm. Here we use a technique to reduce total searching comparisons by creating an index on a specific field, we have defined it as keyCode field, in a table of our
provides a novel technique for indexing the web documents based on the context of keywords that helps a search engine to serve a query with more specific documents, and relevant contents.
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.