为位置感知移动服务索引连续范围查询

IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004 Pub Date : 2004-03-28 DOI:10.1109/EEE.2004.1287315

Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu

{"title":"为位置感知移动服务索引连续范围查询","authors":"Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu","doi":"10.1109/EEE.2004.1287315","DOIUrl":null,"url":null,"abstract":"We study a new main memory-based approach to indexing continual range queries to support location-aware mobile services. The query index is used to efficiently answer the following question repeatedly: \"Which moving objects are currently located inside the boundaries of individual queries?\" We present a covering tile-based (COVET) query index, where adjacent covering tiles touch each other only at the edges. A set of virtual tiles is predefined, each with a unique ID. One or more of the virtual tiles are used to strictly cover individual range queries. A COVET index maintains a direct mapping between covering tiles and queries. It allows query evaluation to take advantage of incremental changes in object locations. Simulations are conducted to evaluate the effectiveness of the COVET index and compare virtual tiles of different shapes and sizes.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Indexing continual range queries for location-aware mobile services\",\"authors\":\"Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu\",\"doi\":\"10.1109/EEE.2004.1287315\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study a new main memory-based approach to indexing continual range queries to support location-aware mobile services. The query index is used to efficiently answer the following question repeatedly: \\\"Which moving objects are currently located inside the boundaries of individual queries?\\\" We present a covering tile-based (COVET) query index, where adjacent covering tiles touch each other only at the edges. A set of virtual tiles is predefined, each with a unique ID. One or more of the virtual tiles are used to strictly cover individual range queries. A COVET index maintains a direct mapping between covering tiles and queries. It allows query evaluation to take advantage of incremental changes in object locations. Simulations are conducted to evaluate the effectiveness of the COVET index and compare virtual tiles of different shapes and sizes.\",\"PeriodicalId\":360167,\"journal\":{\"name\":\"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EEE.2004.1287315\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEE.2004.1287315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

我们研究了一种新的基于主存储器的索引连续范围查询的方法，以支持位置感知移动服务。查询索引用于有效地重复回答以下问题:“哪些移动对象当前位于单个查询的边界内?”我们提出了一个基于覆盖块(COVET)的查询索引，其中相邻的覆盖块仅在边缘处相互接触。预定义了一组虚拟磁贴，每个磁贴都有一个惟一的ID。一个或多个虚拟块用于严格覆盖单个范围查询。COVET索引维护覆盖块和查询之间的直接映射。它允许查询求值利用对象位置的增量变化。通过仿真来评估COVET指数的有效性，并对不同形状和大小的虚拟瓷砖进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Indexing continual range queries for location-aware mobile services

We study a new main memory-based approach to indexing continual range queries to support location-aware mobile services. The query index is used to efficiently answer the following question repeatedly: "Which moving objects are currently located inside the boundaries of individual queries?" We present a covering tile-based (COVET) query index, where adjacent covering tiles touch each other only at the edges. A set of virtual tiles is predefined, each with a unique ID. One or more of the virtual tiles are used to strictly cover individual range queries. A COVET index maintains a direct mapping between covering tiles and queries. It allows query evaluation to take advantage of incremental changes in object locations. Simulations are conducted to evaluate the effectiveness of the COVET index and compare virtual tiles of different shapes and sizes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004

自引率

0.00%

发文量