20120914
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| 20120914 [2012/09/07 11:05] – created root | 20120914 [2012/09/14 11:50] (current) – xkxie | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| **Department news**: \\ | **Department news**: \\ | ||
| + | |||
| + | |||
| **Presentation (discussion)** \\ | **Presentation (discussion)** \\ | ||
| - | This Friday Xike Xie will give a presentation. | + | This Friday |
| **Title**\\ | **Title**\\ | ||
| - | tobedef | + | Efficient Distance-Aware Query Evaluation on Indoor Moving Objects |
| **Abstract**\\ | **Abstract**\\ | ||
| - | tobedef | + | Indoor spaces accommodate large parts of people’s life. The increasing availability of indoor positioning, |
| + | |||
| + | In this paper, we propose a complete set of techniques for efficient distance-aware queries on indoor moving objects. We define and categorize the indoor distances in relation to indoor uncertain objects, and derive different distance bounds that can facilitate query evaluation. Existing works often assume indoor floor plans are static, and require extensive pre-computation on indoor topologies. In contrast, we design a composite index scheme that integrates indoor geometries, indoor topologies, as well as indoor uncertain objects, and thus supports indoor distance-aware queries efficiently without time-consuming and volatile distance computation. We design algorithms for range query and k nearest neighbor query on indoor moving objects. The results of extensive experimental studies demonstrate that our proposals are efficient and scalable in evaluating distance-aware | ||
| + | queries over indoor moving objects. | ||
| **Keywords**\\ | **Keywords**\\ | ||
| - | tobedef | + | Indoor applications, |
| **Attendance: | **Attendance: | ||
20120914.1347015926.txt.gz · Last modified: by root
