Sciweavers

14248 search results - page 195 / 2850
» Queries
Sort
View
WAIM
2010
Springer
15 years 2 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan
ICDE
2011
IEEE
220views Database» more  ICDE 2011»
14 years 8 months ago
Generating test data for killing SQL mutants: A constraint-based approach
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
Shetal Shah, S. Sudarshan, Suhas Kajbaje, Sandeep ...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 6 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
16 years 5 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
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
16 years 5 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...