Sciweavers

2985 search results - page 59 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
148
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
SIGMOD
1996
ACM
99views Database» more  SIGMOD 1996»
15 years 6 months ago
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data...
Leonid Libkin, Rona Machlin, Limsoon Wong
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 6 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
202
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 4 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
107
Voted
JSSPP
2005
Springer
15 years 8 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan