The problem of continuously monitoring multiple K-nearest neighbor (K-NN) queries with dynamic object and query dataset is valuable for many location-based applications. A practical method is to partition the data spa...The problem of continuously monitoring multiple K-nearest neighbor (K-NN) queries with dynamic object and query dataset is valuable for many location-based applications. A practical method is to partition the data space into grid cells, with both object and query table being indexed by this grid structure, while solving the problem by periodically joining cells of objects with queries having their influence regions intersecting the cells. In the worst case, all cells of objects will be accessed once. Object and query cache strategies are proposed to further reduce the I/O cost. With object cache strategy, queries remaining static in current processing cycle seldom need I/O cost, they can be returned quickly. The main I/O cost comes from moving queries, the query cache strategy is used to restrict their search-regions, which uses current results of queries in the main memory buffer. The queries can share not only the accessing of object pages, but also their influence regions. Theoretical analysis of the expected I/O cost is presented, with the I/O cost being about 40% that of the SEA-CNN method in the experiment results.展开更多
With the rapid development of mobile communication technology and intelligent applications,the quantity of mobile devices and data traffic in networks have been growing exponentially,which poses a great burden to netw...With the rapid development of mobile communication technology and intelligent applications,the quantity of mobile devices and data traffic in networks have been growing exponentially,which poses a great burden to networks and brings huge challenge to servicing user demand.Edge caching,which utilizes the storage and computation resources of the edge to bring resources closer to end users,is a promising way to relieve network burden and enhance user experience.In this paper,we aim to survey the edge caching techniques from a comprehensive and systematic perspective.We first present an overview of edge caching,summarizing the three key issues regarding edge caching,i.e.,where,what,and how to cache,and then introducing several significant caching metrics.We then carry out a detailed and in-depth elaboration on these three issues,which correspond to caching locations,caching objects,and caching strategies,respectively.In particular,we innovate on the issue“what to cache”,interpreting it as the classification of the“caching objects”,which can be further classified into content cache,data cache,and service cache.Finally,we discuss several open issues and challenges of edge caching to inspire future investigations in this research area.展开更多
基金Project (No.ABA048) supported by the Natural Science Foundationof Hubei Province,China
文摘The problem of continuously monitoring multiple K-nearest neighbor (K-NN) queries with dynamic object and query dataset is valuable for many location-based applications. A practical method is to partition the data space into grid cells, with both object and query table being indexed by this grid structure, while solving the problem by periodically joining cells of objects with queries having their influence regions intersecting the cells. In the worst case, all cells of objects will be accessed once. Object and query cache strategies are proposed to further reduce the I/O cost. With object cache strategy, queries remaining static in current processing cycle seldom need I/O cost, they can be returned quickly. The main I/O cost comes from moving queries, the query cache strategy is used to restrict their search-regions, which uses current results of queries in the main memory buffer. The queries can share not only the accessing of object pages, but also their influence regions. Theoretical analysis of the expected I/O cost is presented, with the I/O cost being about 40% that of the SEA-CNN method in the experiment results.
基金supported by the National Natural Science Foundation of China(No.92267104)the Natural Science Foundation of Jiangsu Province of China(No.BK20211284)Financial and Science Technology Plan Project of Xinjiang Production and Construction Corps(No.2020DB005).
文摘With the rapid development of mobile communication technology and intelligent applications,the quantity of mobile devices and data traffic in networks have been growing exponentially,which poses a great burden to networks and brings huge challenge to servicing user demand.Edge caching,which utilizes the storage and computation resources of the edge to bring resources closer to end users,is a promising way to relieve network burden and enhance user experience.In this paper,we aim to survey the edge caching techniques from a comprehensive and systematic perspective.We first present an overview of edge caching,summarizing the three key issues regarding edge caching,i.e.,where,what,and how to cache,and then introducing several significant caching metrics.We then carry out a detailed and in-depth elaboration on these three issues,which correspond to caching locations,caching objects,and caching strategies,respectively.In particular,we innovate on the issue“what to cache”,interpreting it as the classification of the“caching objects”,which can be further classified into content cache,data cache,and service cache.Finally,we discuss several open issues and challenges of edge caching to inspire future investigations in this research area.
