184 search results - page 29 / 37 » A new range query algorithm for Universal B-trees |
113
click to vote
EUSFLAT
2009
14 years 9 months ago
2009
Diverse forms of the concept of opposition are already existent in philosophy, linguistics, psychology and physics. The interplay between entities and opposite entities is apparent...
WEA
2007
Springer
15 years 5 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
199
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
162
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
104
click to vote
CP
2009
Springer
15 years 6 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...