Sciweavers

3652 search results - page 278 / 731
» A study of query length
Sort
View
229
Voted
ICDE
2002
IEEE
112views Database» more  ICDE 2002»
16 years 4 months ago
Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
16 years 3 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 3 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
135
Voted
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 3 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
118
Voted
FASE
2009
Springer
15 years 10 months ago
SNIFF: A Search Engine for Java Using Free-Form Queries
Reuse of existing libraries simplifies software development efforts. However, these libraries are often complex and reusing the APIs in the libraries involves a steep learning cu...
Shaunak Chatterjee, Sudeep Juvekar, Koushik Sen