ParSCL: A Parallel and Distributed Framework to Process All Nearest Neighbor Queries on a Road NetworkIEEE ACCESSIF3.62023-01-010OA
A Unified Approach to Spatial Proximity Query Processing in Dynamic Spatial NetworksSENSORSIF3.52021-08-040OAAI
Group Processing of Multiple k-Farthest Neighbor Queries in Road NetworksIEEE ACCESSIF3.62020-01-015OAAI
A collaborative approach to moving k-nearest neighbor queries in directed and dynamic road networksPERVASIVE AND MOBILE COMPUTINGIF3.52015-02-015PREAI
An Encryption Approach to Secure Modification and Deletion for Flash-based StorageIEEE TRANSACTIONS ON CONSUMER ELECTRONICSIF10.92014-11-014PREAI
An efficient algorithm for computing safe exit points of moving range queries in directed road networksenterprise information systemsIF3.42014-05-0116PREAI
Three-State Log-Aware Buffer Management Scheme for Flash-Based Consumer ElectronicsIEEE TRANSACTIONS ON CONSUMER ELECTRONICSIF10.92013-11-014PREAI
Continuous range k-nearest neighbor queries in vehicular ad hoc networksJOURNAL OF SYSTEMS AND SOFTWAREIF4.12013-05-0113PREAI
Indexing range sum queries in spatio-temporal databasesINFORMATION AND SOFTWARE TECHNOLOGYIF4.32007-04-0112PREAI
An adaptive indexing technique using spatio-temporal query workloadsINFORMATION AND SOFTWARE TECHNOLOGYIF4.32004-03-014OAAI
Heuristic approach for early separated filter and refinement strategy in spatial query optimizationJOURNAL OF SYSTEMS AND SOFTWAREIF4.12002-06-012PREAI