Storing and querying time series data in a sensor network

This thesis contains several contributions that extend from the sensor networkto the time series data research disciplines. Our contributions are asfollows: We provide a path decomposition technique that is capable of systematicallyand autonomously producing mobile sink paths for data gatheringin large sensor networks. We also provide an energy-efficient routingprotocol that is used to establish a path between two nodes in a sensor network.This protocol allows users to query a sensor network directly withoutthe need for the mobile sink. As the size of the sensor database is gettinglarger, we incorporate the storing, indexing and querying techniques into aninsertion and retrieval framework. This shortens the querying time. Wealso identify a problem that exists during the filetering phase. To rectifythis problem, we provide a stitching algorithm. This technique computes animproved lower bounding distance. As a result, the query time is reduced