Sciweavers

2092 search results - page 81 / 419
» Dynamically Distributed Query Evaluation
Sort
View
130
Voted
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
16 years 2 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
FQAS
2004
Springer
112views Database» more  FQAS 2004»
15 years 8 months ago
WS-CatalogNet: Building Peer-to-Peer e-Catalog
One of the key issues in product catalogs is how to efficiently integrate and query large, intricate, heterogeneous catalogs. We propose a framework for building a dynamic catalog...
Hye-Young Paik, Boualem Benatallah, Farouk Toumani
130
Voted
CLOUD
2010
ACM
15 years 7 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...
128
Voted
DAWAK
2008
Springer
15 years 4 months ago
Efficient Data Distribution for DWS
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
Raquel Almeida, Jorge Vieira, Marco Vieira, Henriq...
RSA
2006
144views more  RSA 2006»
15 years 2 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...