Sciweavers

1007 search results - page 13 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
JEA
2008
120views more  JEA 2008»
14 years 11 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
COMPGEOM
2007
ACM
15 years 3 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
DMG
2005
Springer
15 years 5 months ago
An Adaptive Distributed Query Processing Grid Service
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid s...
Fabio Porto, Vinícius F. V. da Silva, M&aac...
94
Voted
ICDCS
2009
IEEE
15 years 6 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li