Sciweavers

439 search results - page 45 / 88
» Unnesting Arbitrary Queries
Sort
View
DAMON
2009
Springer
14 years 4 months ago
Spinning relations: high-speed networks for distributed join processing
By leveraging modern networking hardware (RDMA-enabled network cards), we can shift priorities in distributed database processing significantly. Complex and sophisticated mechani...
Philip Werner Frey, Romulo Goncalves, Martin L. Ke...
PODC
2004
ACM
14 years 3 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
EDBT
2000
ACM
14 years 1 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 10 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 11 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei