NDLI: Durable Queries over Historical Time Series

Content Provider	IEEE Xplore Digital Library
Author	Hao Wang Cai, Y. Yin Yang Shiming Zhang Mamoulis, N.
Copyright Year	1989
Abstract	This paper studies the problem of finding objects with durable quality over time in historical time series databases. For example, a sociologist may be interested in the top 10 web search terms during the period of some historical events; the police may seek for vehicles that move close to a suspect 70 percent of the time during a certain time period and so on. Durable top-k (DTop-k) and nearest neighbor (DkNN) queries can be viewed as natural extensions of the standard snapshot top-k and NN queries to timestamped sequences of values or locations. Although their snapshot counterparts have been studied extensively, to our knowledge, there is little prior work that addresses this new class of durable queries. Existing methods for DTop-k processing either apply trivial solutions, or rely on domain-specific properties. Motivated by this, we propose efficient and scalable algorithms for the DTop-k and DkNN queries, based on novel indexing and query evaluation techniques. Our experiments show that the proposed algorithms outperform previous and baseline solutions by a wide margin.
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	595
Ending Page	607
Page Count	13
File Size	2234012
File Format	PDF
ISSN	10414347
Volume Number	26
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Time series analysis Indexing Trajectory Knowledge discovery Data engineering Search problems spatiotemporal databases Durable query time series historical data
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Similarity Search over Future Stream Time Series

Querying time series data based on similarity

A Framework for Similarity Search of Time Series Cliques with Natural Relations

Continuous Monitoring of Distance-Based Range Queries

Optimizing top-k selection queries over multimedia repositories

Scalable Evaluation of Trajectory Queries over Imprecise Location Data

Efficient Prediction of Difficult Keyword Queries over Databases

Optimizing similarity search for arbitrary length time series queries

Access Structures for Angular Similarity Queries

Durable Queries over Historical Time Series

Similar Documents

Efficient Similarity Search over Future Stream Time Series

Querying time series data based on similarity

A Framework for Similarity Search of Time Series Cliques with Natural Relations

Continuous Monitoring of Distance-Based Range Queries

Optimizing top-k selection queries over multimedia repositories

Scalable Evaluation of Trajectory Queries over Imprecise Location Data

Efficient Prediction of Difficult Keyword Queries over Databases

Optimizing similarity search for arbitrary length time series queries

Access Structures for Angular Similarity Queries

Durable Queries over Historical Time Series