806 search results - page 114 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
MOBICOM
2004
ACM
14 years 1 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
PDIS
1994
IEEE
13 years 11 months ago
1994
IEEE
We propose a new client-side data-caching scheme for relational databases with a central server and multiple clients. Data are loaded into each client cache based on queries execut...
CIDR
2003
13 years 9 months ago
2003
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...