Sciweavers

5 search results - page 1 / 1
» A hybrid aggregation and compression technique for road netw...
Sort
View
KAIS
2008
112views more  KAIS 2008»
13 years 4 months ago
A hybrid aggregation and compression technique for road network databases
Abstract Vector data and in particular road networks are being queried, hosted and processed in many application domains such as in mobile computing. Many client systems such as PD...
Ali Khoshgozaran, Ali Khodaei, Mehdi Sharifzadeh, ...
SSD
2007
Springer
133views Database» more  SSD 2007»
13 years 10 months ago
Compression of Digital Road Networks
Abstract. In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases st...
Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T...
SSDBM
2003
IEEE
137views Database» more  SSDBM 2003»
13 years 10 months ago
Supporting Sliding Window Queries for Continuous Data Streams
Although traditional databases and data warehouses have been exploited widely to manage persistent data, a large number of applications from sensor network need functional support...
Lin Qiao, Divyakant Agrawal, Amr El Abbadi
CIKM
2009
Springer
13 years 8 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 7 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu