Sciweavers

911 search results - page 85 / 183
» On the Distance of Databases
Sort
View
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
DASFAA
2011
IEEE
250views Database» more  DASFAA 2011»
12 years 11 months ago
An FTL-Agnostic Layer to Improve Random Write on Flash Memory
Flash memories are considered a competitive alternative to rotating disks as non-volatile data storage for database management systems. However, even if the Flash Translation Layer...
Brice Chardin, Olivier Pasteur, Jean-Marc Petit
VLDB
2007
ACM
197views Database» more  VLDB 2007»
14 years 8 months ago
Indexable PLA for Efficient Similarity Search
Similarity-based search over time-series databases has been a hot research topic for a long history, which is widely used in many applications, including multimedia retrieval, dat...
Qiuxia Chen, Lei Chen 0002, Xiang Lian, Yunhao Liu...
EDBT
2012
ACM
255views Database» more  EDBT 2012»
11 years 10 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
14 years 7 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...