• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 9,300
Next 10 →

Public Key Encryption with Keyword Search

by Dan Boneh, Giovanni Di Crescenzo , Rafail Ostrovsky , Giuseppe Persiano
"... ..."
Abstract - Cited by 383 (12 self) - Add to MetaCart
Abstract not found

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

XRANK: Ranked Keyword Search over XML Documents

by Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmugasundaram , 2003
"... We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating ..."
Abstract - Cited by 261 (1 self) - Add to MetaCart
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating

DISCOVER: Keyword Search in Relational Databases

by Vagelis Hristidis, Yannis Papakonstantinou - In VLDB , 2002
"... DISCOVER operates on relational databases and facilitates information discovery on them by allowing its user to issue keyword queries without any knowledge of the database schema or of SQL. ..."
Abstract - Cited by 255 (7 self) - Add to MetaCart
DISCOVER operates on relational databases and facilitates information discovery on them by allowing its user to issue keyword queries without any knowledge of the database schema or of SQL.

Keyword searching and browsing in databases using BANKS

by Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan - In ICDE , 2002
"... With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of query languages; even relatively simple query languages designed for non-experts are too complicated for them. We describe BA ..."
Abstract - Cited by 321 (14 self) - Add to MetaCart
BANKS, a system which enables keyword-based search on relational databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowledge of the schema or any need for writing complex queries. A user can get information by typing a few

Keyword Search in Databases

by Arvind Hulgeri , Gaurav Bhalotia, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan - IEEE DATA ENGINEERING BULLETIN , 2001
"... Querying using keywords is easily the most widely used form of querying today. While keyword searching is widely used to search documents on the Web, querying of databases currently relies on complex query languages that are inappropriate for casual end-users, since they are complex and hard to lear ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
Querying using keywords is easily the most widely used form of querying today. While keyword searching is widely used to search documents on the Web, querying of databases currently relies on complex query languages that are inappropriate for casual end-users, since they are complex and hard

Oblivious Keyword Search

by Wakaha Ogata, Kaoru Kurosawa , 2002
"... In this paper, we introduce a notion of Oblivious Keyword Search (OKS). Let W be the set of possible keywords. In the commit phase, a database supplier T commits n data. In each transfer subphase, a user U can choose a keyword w 2 W adaptively and nd Search(w) without revealing w to T , where Searc ..."
Abstract - Cited by 36 (3 self) - Add to MetaCart
In this paper, we introduce a notion of Oblivious Keyword Search (OKS). Let W be the set of possible keywords. In the commit phase, a database supplier T commits n data. In each transfer subphase, a user U can choose a keyword w 2 W adaptively and nd Search(w) without revealing w to T , where

Blinks: Ranked keyword searches on graphs

by Hao He, Haixun Wang, Jun Yang, Philip S. Yu , 2007
"... Query processing over graph-structured data is enjoying a growing number of applications. A top-k keyword search query on a graph nds the top k answers according to some ranking criteria, where each answer is a substructure of the graph containing all query keywords. Current techniques for supportin ..."
Abstract - Cited by 139 (9 self) - Add to MetaCart
Query processing over graph-structured data is enjoying a growing number of applications. A top-k keyword search query on a graph nds the top k answers according to some ranking criteria, where each answer is a substructure of the graph containing all query keywords. Current techniques

Relational Keyword Search System

by Pradeep M. Ghige, Prof Ruhi, R. Kabra
"... Abstract — Now a day’s for extending the keyword search to relational data set has been an area of research within the database and Information Retrieval. There is no standardization in the process if information retrieval, which will not clearly show the actual result also it displays keyword searc ..."
Abstract - Add to MetaCart
Abstract — Now a day’s for extending the keyword search to relational data set has been an area of research within the database and Information Retrieval. There is no standardization in the process if information retrieval, which will not clearly show the actual result also it displays keyword

Efficient Keyword Search for Smallest LCAs in XML Databases

by Yu Xu, Yannis Papakonstantinou - In SIGMOD Conference , 2005
"... Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe corre-sponding efficient algorithms. The proposed keyword search re- ..."
Abstract - Cited by 164 (7 self) - Add to MetaCart
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe corre-sponding efficient algorithms. The proposed keyword search re-
Next 10 →
Results 1 - 10 of 9,300
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University