Sciweavers

2124 search results - page 364 / 425
» An Efficient Framework for Order Optimization
Sort
View
CONCURRENCY
2002
230views more  CONCURRENCY 2002»
15 years 6 months ago
Economic models for resource management and scheduling in Grid computing
: The accelerated development in Peer-to-Peer (P2P) and Grid computing has positioned them as promising next generation computing platforms. They enable the creation of Virtual Ent...
Rajkumar Buyya, David Abramson, Jonathan Giddy, He...
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
16 years 7 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 6 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
16 years 6 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
DCC
2004
IEEE
16 years 5 months ago
Discrete Universal Filtering Through Incremental Parsing
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinb...