Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

SSDBM
2006
IEEE

96views Database» more SSDBM 2006»

Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations

15 years 10 months ago

Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations

Download www.stanford.edu

Hans-Peter Kriegel, Peer Kröger, Matthias Sch

Real-time Traffic

Database | SSDBM 2006 |

claim paper

Related Content

» The HybridLayer Index A synergic approach to answering topk queries in arbitrary subspaces

» SKYPEER Efficient Subspace Skyline Computation over Distributed Data

» Dimensionality reduction using magnitude and shape approximations

» Efficient reverse knearest neighbor search in arbitrary metric spaces

» Efficient skyline retrieval with arbitrary similarity measures

» Theoretical Properties of Projection Based Multilayer Perceptrons with Functional Inputs

» Effective and Efficient Indexing for Large Video Databases

» Object localization based on directional information case of 2D vector data

» Efficient interactive fuzzy keyword search

Post Info
More Details (n/a)

Added	12 Jun 2010
Updated	12 Jun 2010
Type	Conference
Year	2006
Where	SSDBM
Authors	Hans-Peter Kriegel, Peer Kröger, Matthias Schubert, Ziyue Zhu

Comments (0)