Sciweavers

1890 search results - page 224 / 378
» Querying Big Data by Accessing Small Data
Sort
View
MEDINFO
2007
177views Healthcare» more  MEDINFO 2007»
15 years 23 days ago
The Molecular Medicine Informatics Model (MMIM)
In 2005, a major collaboration in Melbourne Australia successfully completed implementing a major medical informatics infrastructure – this is now being used for discovery resear...
Marienne Hibbert, Peter Gibbs, Terence O'brien, Pe...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 20 days 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
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 2 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
DEXA
2007
Springer
141views Database» more  DEXA 2007»
15 years 5 months ago
Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and...
Sven Helmer, Robin Aly, Thomas Neumann, Guido Moer...
CIKM
2008
Springer
15 years 1 months ago
Trada: tree based ranking function adaptation
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, La...