Sciweavers

830 search results - page 143 / 166
» Route kernels for trees
Sort
View
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
15 years 12 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
HPCA
2000
IEEE
15 years 4 months ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
BMCBI
2010
74views more  BMCBI 2010»
14 years 12 months ago
A weighted q-gram method for glycan structure classification
Background: Glycobiology pertains to the study of carbohydrate sugar chains, or glycans, in a particular cell or organism. Many computational approaches have been proposed for ana...
Limin Li, Wai-Ki Ching, Takako Yamaguchi, Kiyoko F...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 1 months ago
Approximate Clustering on Distributed Data Streams
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
Qi Zhang, Jinze Liu, Wei Wang 0010
MOBIHOC
2007
ACM
15 years 11 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung