Sciweavers

92 search results - page 12 / 19
» How to Evaluate Multiple Range-Sum Queries Progressively
Sort
View
102
Voted
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 12 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
CCGRID
2008
IEEE
15 years 6 months ago
Optimized Distributed Data Sharing Substrate in Multi-core Commodity Clusters: A Comprehensive Study with Applications
Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed abstractions to ...
Karthikeyan Vaidyanathan, Ping Lai, Sundeep Narrav...
ICDE
2005
IEEE
113views Database» more  ICDE 2005»
16 years 1 months ago
On the Optimal Ordering of Maps and Selections under Factorization
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
Thomas Neumann, Sven Helmer, Guido Moerkotte
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
14 years 3 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
LOGCOM
2008
81views more  LOGCOM 2008»
14 years 11 months ago
The Semantic Processing of Continuous Quantities for Discrete Terms in Ontologies
We consider continuous quantities that are used to describe the physical world, such as colour, shape, sound, texture, and spatial and temporal arrangements. Natural languages are...
Shenghui Wang, David E. Rydeheard, Jeff Z. Pan