Sciweavers

54 search results - page 8 / 11
» Approximate String Search in Spatial Databases
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
GIS
2005
ACM
14 years 8 months ago
Shapes based trajectory queries for moving objects
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
Bin Lin, Jianwen Su
VLDB
2007
ACM
191views Database» more  VLDB 2007»
14 years 7 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
14 years 8 days ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 7 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...