Sciweavers

1031 search results - page 87 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
IPPS
2006
IEEE
15 years 6 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
206
Voted
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
16 years 26 days ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
CLUSTER
2005
IEEE
15 years 6 months ago
Memory Management Support for Multi-Programmed Remote Direct Memory Access (RDMA) Systems
Current operating systems offer basic support for network interface controllers (NICs) supporting remote direct memory access (RDMA). Such support typically consists of a device d...
Kostas Magoutis
103
Voted
STACS
2007
Springer
15 years 6 months ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
78
Voted
CIKM
1999
Springer
15 years 4 months ago
Page Access Scheduling in Join Processing
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon