Sciweavers

PVLDB
2010
103views more  PVLDB 2010»
13 years 2 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
IPL
2010
94views more  IPL 2010»
13 years 2 months ago
A compact data structure for representing a dynamic multiset
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
Jyrki Katajainen, S. Srinivasa Rao
INFOCOM
2010
IEEE
13 years 2 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
DAM
2010
104views more  DAM 2010»
13 years 2 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
CGF
2010
181views more  CGF 2010»
13 years 3 months ago
Matrix Trees
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
Nathan Andrysco, Xavier Tricoche
TOIS
2002
97views more  TOIS 2002»
13 years 3 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
TCS
2002
13 years 3 months ago
Augmenting the discrete timed automaton with other data structures
We describe a general automata-theoretic approach for analyzing the veri
Oscar H. Ibarra, Jianwen Su
SPE
2002
141views more  SPE 2002»
13 years 3 months ago
Data collection and restoration for heterogeneous process migration
This study presents a practical solution for data collection and restoration to migrate a process written in high level stack-based languages such as C and Fortran over a network ...
Kasidit Chanchio, Xian-He Sun
SIGPLAN
2002
13 years 3 months ago
Template meta-programming for Haskell
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithm...
Tim Sheard, Simon L. Peyton Jones
SIGPLAN
2002
13 years 3 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen