Sciweavers

2372 search results - page 232 / 475
» is 2012
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 3 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 3 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 3 months ago
DESKS: Direction-Aware Spatial Keyword Search
— Location-based services (LBS) have been widely accepted by mobile users. Many LBS users have direction-aware search requirement that answers must be in a search direction. Howe...
Guoliang Li, Jianhua Feng, Jing Xu
139
Voted
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 3 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 3 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...