With the advances in mobile computing and mobile communication technology, there comes a kind of novel applications in which the locations of moving objects are maintained and processed. In existing literatures, a dat...With the advances in mobile computing and mobile communication technology, there comes a kind of novel applications in which the locations of moving objects are maintained and processed. In existing literatures, a data model called moving objects sptio-temporal (MOST) is proposed and a new location record is generated when the distance between the actual location and the database location of a moving object exceeds a pre-defined distance threshold. In a mobile computing environment, a user can issue location-dependent continuous queries (LDCQs). To cater for the large number of moving objects in the system, this paper first gives a hierarchical distributed location database model to store the locations of moving objects. Based on the distribution of the location databases for different moving objects, this paper then proposes a method to determine the processing site for a location-dependent query. When a LDCQ is processed, a set of tuples <O, begin, end> Is provided indicating that object O satisfies the condition presented in the LDCQ from time begin to end. In the existing literatures, when there is a location update generation, the related LDCQ is re-processed and the answering tuples are re-transmitted via the wireless channel. This location-update-based LDCQ processing method has its disadvantages: it has much CPU calculation cost and imposes a high overhead in the wireless bandwidth which is very undesirable In a wirelss environment. Based on the maximal speed of a moving object, this paper presents a deferred LDCQ evaluation strategy.展开更多
The idea of positional inverted index is exploited for indexing of graph database. The main idea is the use of hashing tables in order to prune a considerable portion of graph database that cannot contain the answer s...The idea of positional inverted index is exploited for indexing of graph database. The main idea is the use of hashing tables in order to prune a considerable portion of graph database that cannot contain the answer set. These tables are implemented using column-based techniques and are used to store graphs of database, frequent sub-graphs and the neighborhood of nodes. In order to exact checking of remaining graphs, the vertex invariant is used for isomorphism test which can be parallel implemented. The results of evaluation indicate that proposed method outperforms existing methods.展开更多
文摘With the advances in mobile computing and mobile communication technology, there comes a kind of novel applications in which the locations of moving objects are maintained and processed. In existing literatures, a data model called moving objects sptio-temporal (MOST) is proposed and a new location record is generated when the distance between the actual location and the database location of a moving object exceeds a pre-defined distance threshold. In a mobile computing environment, a user can issue location-dependent continuous queries (LDCQs). To cater for the large number of moving objects in the system, this paper first gives a hierarchical distributed location database model to store the locations of moving objects. Based on the distribution of the location databases for different moving objects, this paper then proposes a method to determine the processing site for a location-dependent query. When a LDCQ is processed, a set of tuples <O, begin, end> Is provided indicating that object O satisfies the condition presented in the LDCQ from time begin to end. In the existing literatures, when there is a location update generation, the related LDCQ is re-processed and the answering tuples are re-transmitted via the wireless channel. This location-update-based LDCQ processing method has its disadvantages: it has much CPU calculation cost and imposes a high overhead in the wireless bandwidth which is very undesirable In a wirelss environment. Based on the maximal speed of a moving object, this paper presents a deferred LDCQ evaluation strategy.
文摘The idea of positional inverted index is exploited for indexing of graph database. The main idea is the use of hashing tables in order to prune a considerable portion of graph database that cannot contain the answer set. These tables are implemented using column-based techniques and are used to store graphs of database, frequent sub-graphs and the neighborhood of nodes. In order to exact checking of remaining graphs, the vertex invariant is used for isomorphism test which can be parallel implemented. The results of evaluation indicate that proposed method outperforms existing methods.
