Sciweavers

4 search results - page 1 / 1
» Efficient Inverted Lists and Query Algorithms for Structured...
Sort
View
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
14 years 5 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,...
SIGMOD
2001
ACM
146views Database» more  SIGMOD 2001»
14 years 4 months ago
On Supporting Containment Queries in Relational Database Management Systems
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, ...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 4 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 4 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder