Results 1 - 10 of 393

Enhanced hypertext categorization using hyperlinks

by Soumen Chakrabarti, Byron Dom, Piotr Indyk , 1998
"... A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profile-based routing and filtering. Therefore, an accurate classifier is ..."
Abstract - Cited by 453 (8 self) - Add to MetaCart
A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profile-based routing and filtering. Therefore, an accurate classifier

Authority-based keyword search in databases

by Andrey Balmin, Vagelis Hristidis, Yannis Papakonstantinou - TODS
"... The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its authori ..."
Abstract - Cited by 220 (13 self) - Add to MetaCart
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its

Approximate string matching

by Patrick A. V. Hall, Geoff R. Dowling - ACM Computing Surveys , 1980
"... Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword. The methods found are classified as either equivalence or similarity problems. Equivalence problems are seen ..."
Abstract - Cited by 161 (0 self) - Add to MetaCart
Approximate matching of strings is reviewed with the aim of surveying techniques suitable for finding an item in a database when there may be a spelling mistake or other error in the keyword. The methods found are classified as either equivalence or similarity problems. Equivalence problems

Efficient keyword search across heterogeneous relational databases

by Mayssam Sayyadian, Hieu Lekhac, Anhai Doan, Luis Gravano - In ICDE , 2007
"... Keyword search is a familiar and potentially effective way to find information of interest that is “locked ” inside relational databases. Current work has generally assumed that answers for a keyword query reside within a single database. Many practical settings, however, require that we combine tup ..."
Abstract - Cited by 44 (4 self) - Add to MetaCart
Keyword search is a familiar and potentially effective way to find information of interest that is “locked ” inside relational databases. Current work has generally assumed that answers for a keyword query reside within a single database. Many practical settings, however, require that we combine

Textpresso: An Ontology-Based Information Retrieval and Extraction System for Biological Literature

by Hans-michael Müller, Eimear E. Kenny, Paul W. Sternberg - PLoS Biol , 2004
"... We have developed Textpresso, a new text-mining system for scientific literature whose capabilities go far beyond those of a simple keyword search engine. Textpresso’s two major elements are a collection of the full text of scientific articles split into individual sentences, and the implementation ..."
Abstract - Cited by 208 (14 self) - Add to MetaCart
search engine enables the user to search for one or a combination of these tags and/or keywords within a sentence or document, and as the ontology allows word meaning to be queried, it is possible to formulate semantic queries. Full text access increases recall of biological data types from 45 % to 95

Finding and Approximating Top-k Answers in Keyword Proximity Search

by Benny Kimelfeld, Yehoshua Sagiv - In Proceedings of the Twenty Fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems , 2005
"... Various approaches for keyword proximity search have been implemented in relational databases, XML and the Web. Yet, in all of them, an answer is a Q-fragment, namely, a subtree T of the given data graph G, such that T contains all the keywords of the query Q and has no proper subtree with this prop ..."
Abstract - Cited by 57 (8 self) - Add to MetaCart
Various approaches for keyword proximity search have been implemented in relational databases, XML and the Web. Yet, in all of them, an answer is a Q-fragment, namely, a subtree T of the given data graph G, such that T contains all the keywords of the query Q and has no proper subtree

Supporting Top-K Keyword Search in XML Databases

by Liang Jeff Chen, Yannis Papakonstantinou
"... Abstract — Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the concept of Lowest Common Ancestor (LCA). However, naive LCA-based semantics leads to exponential computation and ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
and unnecessarily expand efforts in the semantic pruning. In this paper, we propose a series of join-based algorithms that combine the semantic pruning and the top-K processing to support top-K keyword search in XML databases. The algorithms essentially reduce the keyword query evaluation to relational joins

A Top-K Keyword Search for Supporting Semantics in Relational Databases

by Wang Bin, Yang Xiao-chun, Wang Guo-ren, Wang B, Yang Xc, Wang Gr, A Top-k
"... Abstract: In order to enhance the search results of keyword search in relational databases, semantic relationship among relations and tuples is employed and a semantic ranking function is proposed. In addition to considering current ranking principles, the proposed semantic ranking function provide ..."
Abstract - Add to MetaCart
Abstract: In order to enhance the search results of keyword search in relational databases, semantic relationship among relations and tuples is employed and a semantic ranking function is proposed. In addition to considering current ranking principles, the proposed semantic ranking function

A Semantic Approach to Keyword Search over Relational Databases

by Zhong Zeng, Zhifeng Bao, Mong Li Lee, Tok Wang Ling
"... Abstract. Research in relational keyword search has been focused on the efficient computation of results as well as strategies to rank and output the most relevant ones. However, the challenge to retrieve the intended results remains. Existing relational keyword search techniques suffer from the pro ..."
Abstract - Add to MetaCart
the problem of returning overwhelming number of results, many of which may not be useful. In this work, we adopt a semantic approach to relational keyword search via an Object-Relationship-Mixed data graph. This graph is constructed based on database schema constraints to capture the semantics of objects

Semantic Linkages with Keyword Based Searching In Relational Databases for Improved Results

by Chandresh Kumar, Chhatlani Dharmesh Bhatt, Rajasthan Jrnrvu
"... ABSTRACT-This paper discusses about Keyword based search for Relational Database. This method is one of the traditional methods, but using in most of the applications regardless of web or desktop. Tools of Relational Databases can store huge amount of information, however, at the time of real-time e ..."
Abstract - Add to MetaCart
ABSTRACT-This paper discusses about Keyword based search for Relational Database. This method is one of the traditional methods, but using in most of the applications regardless of web or desktop. Tools of Relational Databases can store huge amount of information, however, at the time of real
Results 1 - 10 of 393