589 search results - page 68 / 118 » Matching Concavity Trees |
135
click to vote
VLDB
2000
ACM
15 years 7 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
148
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper extends the traditional binocular stereo problem into the spacetime domain, in which a pair of video streams is matched simultaneously instead of matching pairs of imag...
245
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
116
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
232
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...