6004 search results - page 373 / 1201 » Parallelizing query optimization |
203
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
206
Voted
IOPADS
1997
15 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
322
Voted
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
159
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
We describe a method for generating accurate, compact, human understandable text classifiers. Text datasets are indexed using Apache Lucene and Genetic Programs are used to constr...
141
click to vote
EUROCAST
2005
Springer
2005
Springer
Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance
16 years 10 days ago
Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information...