2338 search results - page 361 / 468 » Using UML to model relational database operations |
129
click to vote
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
172
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
122
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
121
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
122
click to vote
SIGMOD
1995
ACM
15 years 6 months ago
1995
ACM
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...