Sciweavers

564 search results - page 62 / 113
» Error-tolerant Tree Matching
Sort
View
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 4 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 3 months ago
Oracle8i Index-Organized Table and Its Application to New Domains
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...
Jagannathan Srinivasan, Souripriya Das, Chuck Frei...
CVPR
2003
IEEE
16 years 1 months ago
Spacetime Stereo: Shape Recovery for Dynamic Scenes
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...
Li Zhang, Brian Curless, Steven M. Seitz
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 1 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
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...
Mirit Shalem, Ziv Bar-Yossef
DAC
2002
ACM
16 years 26 days ago
A flexible accelerator for layer 7 networking applications
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 ...
Gokhan Memik, William H. Mangione-Smith