Sciweavers

10412 search results - page 2000 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 2 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 2 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
SIGMOD
2001
ACM
146views Database» more  SIGMOD 2001»
16 years 2 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, ...
PODS
2008
ACM
128views Database» more  PODS 2008»
16 years 2 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
EDBT
2004
ACM
121views Database» more  EDBT 2004»
16 years 2 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
« Prev « First page 2000 / 2083 Last » Next »