Sciweavers

412 search results - page 12 / 83
» Ranked Join Indices
Sort
View
CCGRID
2007
IEEE
14 years 1 months ago
Exploiting Lustre File Joining for Effective Collective IO
Lustre is a parallel file system that presents high aggregated IO bandwidth by striping file extents across many storage devices. However, our experiments indicate excessively wid...
Weikuan Yu, Jeffrey S. Vetter, Shane Canon, Song J...
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
14 years 8 months ago
Top-k Spatial Joins of Probabilistic Objects
Probabilistic data have recently become popular in applications such as scientific and geospatial databases. For images and other spatial datasets, probabilistic values can capture...
Vebjorn Ljosa, Ambuj K. Singh
DAM
2010
137views more  DAM 2010»
13 years 6 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 10 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
ICSOC
2010
Springer
13 years 4 months ago
Panta Rhei: Optimized and Ranked Data Processing over Heterogeneous Sources
In the era of digital information, the value of data resides not only in its volume and quality, but also in the additional information that can be inferred from the combination (a...
Daniele Braga, Francesco Corcoglioniti, Michael Gr...