21 search results - page 3 / 5 » Determining the Convex Hull in Large Multidimensional Databa... |
KDD
2000
ACM
13 years 8 months ago
2000
ACM
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...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
DASFAA
2004
IEEE
13 years 8 months ago
2004
IEEE
Abstract. Data declustering speeds up large data set retrieval by partitioning the data across multiple disks or sites and performing retrievals in parallel. Performance is determi...
BTW
1999
Springer
13 years 9 months ago
1999
Springer
Conceptual Information Systems provide a multi-dimensional conceptually structured view on data stored in relational databases. On restricting the expressiveness of the retrieval l...
SIGMOD
1996
ACM
13 years 9 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...