A5109864677- Data Management and Algorithms
- Advanced Database Systems and Queries
- Data Mining Algorithms and Applications
- Geographic Information Systems Studies
- Peer-to-Peer Network Technologies
- Constraint Satisfaction and Optimization
- Cloud Data Security Solutions
- Privacy-Preserving Technologies in Data
- Access Control and Trust
- Service-Oriented Architecture and Web Services
- Semantic Web and Ontologies
- Advanced Authentication Protocols Security
- Distributed systems and fault tolerance
- RFID technology advancements
- Graph Theory and Algorithms
- Advanced Image and Video Retrieval Techniques
- Vehicular Ad Hoc Networks (VANETs)
- Automated Road and Building Extraction
Macau University of Science and Technology
2025
Purdue University West Lafayette
2004-2017
University of Minnesota
2004-2017
University of Indianapolis
2008
Indiana University – Purdue University Indianapolis
2008
Location-aware environments are characterized by a large number of objects and continuous queries. Both the queries may change their locations over time. In this paper, we focus on k-nearest neighbor (CKNN, for short). We present new algorithm, termed SEA-CNN, answering continuously collection concurrent CKNN SEA-CNN has two important features: incremental evaluation shared execution. achieves both efficiency scalability in presence set Furthermore, does not make any assumptions about...
We present the demonstration of design "STEAM", Purdue Boiler Makers' stream database system that allows for processing continuous and snap-shot queries over data streams. Specifically, focuses on query engine, "Nile". Nile extends processor engine an object-relational management system, PREDATOR, to process supports extended SQL operators handle sliding-window execution as approach restrict size stored state in such join.
The problem of frequently updating multi-dimensional indexes arises in many location-dependent applications. While the R-tree and its variants are one dominant choices for indexing objects, exhibits inferior performance presence frequent updates. In this paper, we present an variant, termed RUM-tree (stands with Update Memo) that minimizes cost object processes updates a memo-based approach avoids disk accesses purging old entries during update process. Therefore, operation reduces to only...
Indexing moving objects is a fundamental issue in spatiotemporal databases. In this paper, we propose an adaptive Lazy-Update Grid-based index (LUGrid, for short) that minimizes the cost of object updates. LUGrid designed with two important features, namely, lazy insertion and deletion. Lazy reduces update I/Os by adding additional memory-resident layer over disk index. deletion avoiding deleting single obsolete entry immediately. Instead, entries are removed later specially mechanisms....
Real-time spatio-temporal query processing needs to effectively handle a large number of moving objects and continuous queries. In this paper, we use shared execution as mechanism support scalability in location-aware servers. Our main idea is maintain table that stores information about Then, answering queries abstracted spatial join among the Three policies are proposed aiming minimize cost operation under paradigm, namely clock-triggered policy, incremental hot policy. We introduce...
In this paper, we introduce PLACE*, a distributed spatio-temporal data stream management system for moving objects. PLACE* supports continuous queries that hop among network of regional servers. To minimize the execution cost, new Query-Track- Participate (QTP) query processing model is proposed inside PLACE*. QTP model, continuously answered by querying server, tracking and set participating focus on plan generation, update algorithms range in using QTP. An extensive experimental study...