Sciweavers

709 search results - page 80 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 6 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
192
Voted
BALT
2006
15 years 9 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 7 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
VLDB
2002
ACM
120views Database» more  VLDB 2002»
16 years 6 months ago
Efficient schemes for managing multiversionXML documents
Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and "...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...