Sciweavers

306 search results - page 13 / 62
» Spark: top-k keyword query in relational databases
Sort
View
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
11 years 9 months ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 8 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
DASFAA
2010
IEEE
220views Database» more  DASFAA 2010»
13 years 4 months ago
An Effective Object-Level XML Keyword Search
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet users' search concerns, we study how to effectively r...
Zhifeng Bao, Jiaheng Lu, Tok Wang Ling, Liang Xu, ...
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 6 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
CIDR
2011
401views Algorithms» more  CIDR 2011»
12 years 10 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...