Sciweavers

2104 search results - page 406 / 421
» Sorting with networks of data structures
Sort
View
ICDE
2009
IEEE
153views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Distribution of Full-Fledged XQuery
Abstract-- We investigate techniques to automatically decompose any XQuery query into subqueries, that can be executed near their data sources; i.e., function-shipping. In this sce...
Ying Zhang, Nan Tang, Peter A. Boncz
ESWS
2007
Springer
14 years 1 months ago
Understanding Large Volumes of Interconnected Individuals by Visual Exploration
Abstract. Ontologies are now used within an increasing number of realworld applications. So far, significant effort has been spend in building tools to support users in creating,...
Olaf Noppens, Thorsten Liebig
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
CF
2006
ACM
13 years 11 months ago
An efficient cache design for scalable glueless shared-memory multiprocessors
Traditionally, cache coherence in large-scale shared-memory multiprocessors has been ensured by means of a distributed directory structure stored in main memory. In this way, the ...
Alberto Ros, Manuel E. Acacio, José M. Garc...