Sciweavers

3652 search results - page 288 / 731
» A study of query length
Sort
View
114
Voted
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 8 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
226
Voted
EIS
2011
290views ECommerce» more  EIS 2011»
14 years 10 months ago
Code query by example
Most software engineering techniques that deal with software products customization are based on anticipation: The software designer has to foresee, somehow, the future needs for ...
Sebastien Vaucouleur
258
Voted
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 4 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
152
Voted
WWW
2006
ACM
16 years 4 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
129
Voted
VLDB
2004
ACM
124views Database» more  VLDB 2004»
15 years 8 months ago
Automated Statistics Collection in DB2 UDB
The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably lo...
Ashraf Aboulnaga, Peter J. Haas, Sam Lightstone, G...