检索结果-内蒙古大学图书馆

Distributed MapReduce processing of location-based aggregate queries in road networks

DISTRIBUTED AND PARALLEL DATABASES 2025年第1期43卷 1-29页

作者： Huang, Yuan-Ko Natl Kaohsiung Univ Sci & Technol Dept Comp Sci & Informat Engn Kaohsiung Taiwan

Recently, the research community focuses on processing various types of location-based queries (or LBQs for short) (e.g., the range and nearest neighbor queries) on spatial objects of the same type in road networks, in which the road distance from objects to the query object is an important metric for determining the query result and needs to be calculated based on the connectivity of the network. The LBQs can be used to find the spatial objects with better spatial closeness (i.e., the shorter road distance to the query object). In many applications, information about the neighboring relationship between different types of objects may be more attractive to the user. As such, the location-based aggregate queries (or LBAggQs for short) are proposed, which consider not only the spatial closeness of objects but also the neighboring relationship between objects. However, the processing techniques for the LBAggQs are mainly based on a centralized paradigm, and hence suffer from highly dynamic environments where a large number of LBAggQs is issued concurrently. In this paper, a distributed processing technique, based on the MapReduce platform, is developed to answer multiple LBAggQs. Three tables To,odist\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T<^>{dist}_{o,o}$$\end{document}, To,pdist\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T<^>{dist}_{o,p}$$\end{document}, and Tp,pdist\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T<^>{

关键词： Location-based queries road networks Location-based aggregate queries MapReduce platform MRSAggDQ algorithm

来源：评论

学校读者我要写书评

暂无评论

Topological insights into the diachrony of ancient road networks: Exploratory predictive modelling in the Andean highlands

引用

JOURNAL OF ARCHAEOLOGICAL SCIENCE 2025年 174卷

作者： Saintenoy, Thibault Llobera, Marcos Thiery, Nicolas M. Fernandez, Marta Crespo Fabrega-Alvarez, Pastor Santos, Ruben CSIC Inst Ciencias Patrimonio Monte Gais S-N Santiago De Compostela Spain Univ Antilles Fac Lettes & Sci Humaines Guadeloupe France Univ Paris 1 Pantheon Sorbonne Archeol Amer CNRS UMR 8096 Paris France Univ Washington Dept Anthropol DigAR Lab Seattle WA USA Univ Paris Saclay CNRS Lab Interdisciplinaire Sci Numer F-91400 Orsay France Univ Tarapaca Dept Antropol Arica Chile

As the footprint of the movements and interactions that shape territories, road networks constitute a key archaeological feature for studying long term territorial dynamics. However, most archaeological research has focused on individual routes at specific periods, and little has been done so far to research road networks' longterm evolution at a regional scale. While the widespread availability of high-resolution aerial imagery facilitates recording ancient road networks in details, their chronological diagnostic remains challenging since road architecture is generally not a reliable proxy and direct stratigraphic dating is limited to very few contexts. This paper outlines a modelling approach to assess the chronology of roads based on their topological relationship with dated settlements, an idea formulated long ago but never technically implemented so far. It presents a case study on a regional road network's evolution during the last millennium, in the arid highlands of northern Chile, which conserve abundant traces and infrastructure of the settlement patterns and movement systems of its ancient territories. The case study shows the potential of this predictive modeling approach to preliminarily assess the chronology of individual road segments, as well as to visualize and characterise the evolution of the whole network through the historical periods. The basic models implemented in this paper to derive probabilities could be further refined for more specific contexts and hypotheses, and applied to many deserts and mountain regions worldwide, where ancient roads and pathways frequently accumulate as part of long-term territorial dynamics.

关键词： road networks Movement system Archaeology Chronology Andes

来源：评论

学校读者我要写书评

暂无评论

Protecting personalized privacy against sensitivity homogeneity attacks over road networks in mobile services

引用

Frontiers of Computer Science 2016年第2期10卷 370-386页

作者： Xiao PAN Weizhang CHEN Lei WU Chunhui PIAO Zhaojun HU School of Economics and Management Shijiazhuang Tiedao University Shijiazhuang 050043 China

Privacy preservation has recently received considerable attention for location-based mobile services. A lot of location cloaking approaches focus on identity and location protection, but few algorithms pay attention to prevent sensitive information disclosure using query semantics. In terms of personalized privacy requirements, all queries in a cloaking set, from some user＇s point of view, are sensitive. These users regard the privacy is breached. This attack is called as the sensitivity homogeneity attack. We show that none of the existing location cloaking approaches can effectively resolve this problem over road networks. We propose a （K, L, P）-anonymity model and a personalized privacy protection cloaking algorithm over road networks, aiming at protecting the identity, location and sensitive information for each user. The main idea of our method is first to partition users into different groups as anonymity requirements. Then, unsafe groups are adjusted by inserting relaxed conservative users considering sensitivity requirements. Finally, segments covered by each group are published to protect location information. The efficiency and effectiveness of the method are validated by a series of carefully designed experiments. The experimental results also show that the price paid for defending against sensitivity homogeneity attacks is small.

关键词： query semantics sensitive information privacy protection road networks location based services

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL PLACEMENT OF WIRELESS CHARGING LANES IN road networks

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2021年第3期17卷 1315-1341页

作者： Ushijima-Mwesigwa, Hayato Khan, Md Zadid Chowdhury, Mashrur A. Safro, Ilya Clemson Univ Sch Comp Clemson SC 29634 USA Clemson Univ Dept Civil Engn Clemson SC 29634 USA

The emergence of electric vehicle wireless charging technology, where a whole lane can be turned into a charging infrastructure, leads to new challenges in the design and analysis of road networks. From a network perspective, a major challenge is determining the most important nodes with respect to the placement of the wireless charging lanes. In other words, given a limited budget, cities could face the decision problem of where to place these wireless charging lanes. With a heavy price tag, a placement without a careful study can lead to inefficient use of limited resources. In this work, the placement of wireless charging lanes is modeled as an integer programming problem. The basic formulation is used as a building block for different realistic scenarios. We carry out experiments using real geospatial data and compare our results to different network-based heuristics. Reproducibility: all datasets, algorithm implementations and mathematical programming formulation presented in this work are available at https://***/hmwesigwa/***

关键词： Resource Allocation Centrality Electric Vehicles road networks

来源：评论

学校读者我要写书评

暂无评论

Clustering Based Energy Efficient and Communication Protocol for Multiple Mix-Zones Over road networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第2期95卷 411-428页

作者： Arain, Qasim Ali Uqaili, Muhammad Aslam Deng, Zhongliang Memon, Imran Jiao, Jichao Shaikh, Muhammad Akram Zubedi, Asma Ashraf, Aisha Arain, Usman Ali Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Sch Econ & Management Beijing 100876 Peoples R China Mehran Univ Engn & Technol Jamshoro Pakistan Mehran Univ Engn & Technol Dept Software Engn Jamshoro Pakistan Mehran Univ Engn & Technol Inst Informat & Commun Technol Jamshoro Pakistan Zhejiang Univ Coll Comp Sci Hangzhou 310027 Zhejiang Peoples R China

The collection of information is one of the most crucial processes in many internet-enabled applications for multiple mix-zones over road networks. It is essential to use road networks for prolonged time duration in an energy efficient manner. However, network life time increases in response of reducing the stability period (i.e. time required before first node dies). The stability period reduces due to the high energy variance of nodes. In this paper, we present a protocol named as clustering based energy efficient and communication protocol (CEECP) for multiple mix-zones over road networks, which is proposed to reduce the loop holes of prevailing clustering protocols. Additionally, we present a novel CEECP for chain scenario to connect with the road side units for gaining benefits of V2V as well as, V2I communication for Cooperative Traffic Information Systems. The stability period is responsible to preserve coverage properties of the network. It analysis that as the stability period increases, the trustworthiness of the network increases. Hence, it is indispensable to articulate a clustering protocol that shall be energy efficient, low energy variant and of high stability. It has been proved that our scheme outperforms SEECP and VBN as well as, includes its variants with respect to stability period and energy variance.

关键词： road networks Multiple mix-zones Energy efficiency Clustering protocol Location based services

来源：评论

学校读者我要写书评

暂无评论

Processing Location-Based Aggregate Queries in road networks

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2020年第4期36卷 921-935页

作者： Huang, Yuan-Ko Natl Kaohsiung Univ Sci & Technol Dept Maritime Informat & Technol Kaohsiung 811 Taiwan

In recent years, the research community has introduced various methods for processing the location-based queries on a single type of objects in road networks. However, in real-life applications user may be interested in obtaining information about different types of objects, in terms of their neighboring relationship. The sets of different types of objects closer to each other are termed the heterogeneous neighboring object sets (or HNO sets for short). To provide users with object information by considering both the spatial closeness of objects to the query object and the neighboring relationship between objects, we present useful and important location-based aggregate queries on finding the HNO sets in road net-works. The location-based aggregate queries are the shortest average distance query (SAvgDQ), the shortest minimal distance query (SMinDQ), the shortest maximal distance query (SMaxDQ), and the shortest sum distance query (SSumDQ). We first utilize a grid index to manage information of data objects and road networks, and then propose the SAvgDQ, SMinDQ, SMaxDQ, and SSumDQ processing algorithms, which are combined with the grid index to efficiently process the four types of location-based aggregate queries, respectively. A comprehensive set of experiments is conducted to demonstrate the efficiency of the proposed processing algorithms using real road network datasets.

关键词： location-based queries road networks heterogeneous neighboring object sets location-based aggregate queries grid index

来源：评论

学校读者我要写书评

暂无评论

Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks

引用

COMPUTERS & OPERATIONS RESEARCH 2017年第Feb.期78卷 420-430页

作者： Dib, Omar Manier, Marie-Ange Moalic, Laurent Caminada, Alexandre Technol Res Inst SystemX F-91120 Palaiseau France OPERA UTBM F-90010 Belfort France

Computing the optimal route to go from one place to another is a highly important issue in road networks. The problem consists of finding the path that minimizes a metric such as distance, time, cost etc. to go from one node to another in a directed or undirected graph. Although standard algorithms such as Dijkstra are capable of computing shortest paths in polynomial times, they become very slow when the network becomes very large. Furthermore, traditional methods are incapable of meeting additional constraints that may arise during routing in transportation systems such as computing multi-objective routes, routing in stochastic networks. Therefore, we have thought about using meta-heuristics to solve the routing issue in road networks. Meta-heuristics are capable of copying with additional constraints and providing optimal or near optimal routes within reasonable computational times even in large-scale networks. The proposed approach is based on a hybridization process done between a Genetic Algorithm (GA) that belongs to the population-based metaheuristics and a variable neighborhood search (VNS) that performs with one single solution. To evaluate our method, we made experimentations using random generated and real road network instances. We compare our approach with two exact algorithms (Dijkstra and Integer Programming) as well as with GA and VNS when they are executed solely. Experimental results have proven the efficiency of our approach in comparison with the other approaches. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Routing road networks Shortest path problem Exact approaches Dijkstra Integer Programming Meta-heuristics Genetic Algorithm VNS Hybrid meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

Fast optimal aggregate point search for a merged set on road networks

引用

INFORMATION SCIENCES 2015年 310卷 52-68页

作者： Sun, Weiwei Chen, Chong Zheng, Baihua Chen, Chunan Zhu, Liang Liu, Weimo Huang, Yan Fudan Univ Sch Comp Sci Shanghai Key Lab Data Sci Shanghai 200433 Peoples R China Singapore Management Univ Sch Informat Syst Singapore 178902 Singapore Univ N Texas Dept Comp Sci & Engn Denton TX 76203 USA

Aggregate nearest neighbor query, which returns an optimal target point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes two algorithms to process MANN query on road networks when aggregate function is max. Then, we extend the algorithms to support other aggregate functions (e.g., sum). Extensive experiments are conducted to examine the behaviors of the solutions in terms of five parameters affecting the performance. The overall experiments show that our strategies to minimize the response time are effective. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Query processing Aggregate nearest neighbor road networks Spatial databases

来源：评论

学校读者我要写书评

暂无评论

Partition-based range query for uncertain trajectories in road networks

引用

GEOINFORMATICA 2015年第1期19卷 61-84页

作者： Chen, Ling Tang, Yanlin Lv, Mingqi Chen, Gencai Zhejiang Univ Coll Comp Sci Hangzhou 310027 Zhejiang Peoples R China

Query processing for trajectory data is a hot topic in the field of moving objects databases (MODs). Most of the previous research work focused on the Euclidean space, and the uncertain trajectories are represented as sheared cylinders. However, in many applications (e.g. traffic management), the movements of moving objects (MOs) are constrained by the road network environments, which makes the previous methods ineffective. In this paper, we firstly construct an uncertain trajectory model, which is composed of a sequence of segment units with earliest arrival time and latest departure time, based on the assuming availability of a maximum speed on each road segment. Secondly, we present a partition-based uncertain trajectory index (PUTI) to facilitate the search of possible MOs within the space and time range in the road networks based on the uncertain trajectory model. It provides appropriate groups to gather segment units of trajectories according to their network distances. Finally, an efficient algorithm for range query is proposed by leveraging the index. The experiments on two datasets demonstrate that the uncertain trajectory model is effective, and PUTI also significantly outperforms the network distance based MON-tree on range query.

关键词： Uncertain trajectories Range query Graph partition road networks

来源：评论

学校读者我要写书评

暂无评论

ROAM: A Fundamental Routing Query on road networks with Efficiency

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2020年第8期32卷 1595-1609页

作者： Luo, Siqiang Cheng, Reynold Kao, Ben Xiao, Xiaokui Zhou, Shuigeng Hu, Jiafeng Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Natl Univ Singapore Sch Comp Singapore 119077 Singapore Fudan Univ Sch Comp Sci Shanghai Inst Intelligent Elect & Syst Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China

Novel road-network applications often recommend a moving object (e.g., a vehicle) about interesting services or tasks on its way to a destination. A taxi-sharing system, for instance, suggests a new passenger to a taxi while it is serving another one. The traveling cost is then shared among these passengers. A fundamental query is: given two nodes s and t, and an area A on road network graph g, is there a "good" route (e.g., short enough path) P from s tot that crosses A in g? In a taxi-sharing system, s and t can be a taxi's current and destined locations, and A contains all the places to which a person waiting for a taxi is willing to walk. Answering this Route and Area Matching (ROAM) Query allows the application involved to recommend appropriate services to users efficiently. In this paper, we examine efficient ROAM query algorithms. Particularly, we develop solutions for finding a rho-route, which is an s-t. path that passes A, with a length of at most (1 + rho) times the shortest distance between s and t. The existence of a rho-route implies that a service or task located at A can be found for a given moving object m, and that m only deviates slightly from its current route. We present comprehensive studies on index-free and index-based algorithms for answering ROAM queries. Comprehensive experiments show that our algorithm runs up to 30 times faster than baseline algorithms.

关键词： road networks query performance indexing graph algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：