Handling infinite temporal data

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Handling infinite temporal data

Source

Journal of Computer and System Sciences archive
Volume 51 , Issue 1 (August 1995) table of contents

Pages: 3 - 17

Year of Publication: 1995

ISSN:0022-0000

Also published in ...

Authors

F. Kabanza
J.-M. Stévenne
P. Wolper

Publisher

Academic Press, Inc. Orlando, FL, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 17

Additional Information:

cited by index terms review collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	10.1006/jcss.1995.1049

CITED BY 17

	Peter Z. Revesz, Safe query languages for constraint databases, ACM Transactions on Database Systems (TODS), v.23 n.1, p.58-99, March 1998
	David Cohen , Peter Jeavons , Peter Jonsson , Manolis Koubarakis, Building tractable disjunctive constraints, Journal of the ACM (JACM), v.47 n.5, p.826-853, Sept. 2000
	Claudio Bettini , X. Sean Wang , Sushil Jajodia, Solving multi-granularity temporal constraint networks, Artificial Intelligence, v.140 n.1-2, p.107-152, September 2002
	Bernard Boigelot , Louis Latour, Counting the solutions of Presburger equations without enumerating them, Theoretical Computer Science, v.313 n.1, p.17-29, 16 February 2004
	Paolo Terenziani, Symbolic User-Defined Periodicity in Temporal Relational Databases, IEEE Transactions on Knowledge and Data Engineering, v.15 n.2, p.489-509, February 2003
	Leonid Libkin, Variable independence for first-order definable constraints, ACM Transactions on Computational Logic (TOCL), v.4 n.4, p.431-451, October 2003
	Lavinia Egidi , Paolo Terenziani, A flexible approach to user-defined symbolic granularities in temporal databases, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
	Gabriel M. Kuper , Jianwen Su, A representation independent language for planar spatial databases with Euclidean distance, Journal of Computer and System Sciences, v.73 n.6, p.845-874, September, 2007
	Lavinia Egidi , Paolo Terenziani, A mathematical framework for the semantics of symbolic languages representing periodic time, Annals of Mathematics and Artificial Intelligence, v.46 n.3, p.317-347, March 2006
	Peter Revesz , Mengchu Cai, Efficient Querying and Animation of Periodic Spatio-Temporal Databases, Annals of Mathematics and Artificial Intelligence, v.36 n.4, p.437-457, December 2002
	Claudio Bettini , Roberto De Sibi, Symbolic representation of user-defined time granularities, Annals of Mathematics and Artificial Intelligence, v.30 n.1-4, p.53-92, 2000
	Robert Morris , Lina Khatib, General Temporal Knowledge for Planning and Data Mining, Annals of Mathematics and Artificial Intelligence, v.33 n.1, p.1-19, September 2001
	Jef Wijsen , Robert Meersman, On the Complexity of Mining Quantitative Association Rules, Data Mining and Knowledge Discovery, v.2 n.3, p.263-281, September 1998
	Alexander Brodsky , Victor E. Segal , Jia Chen , Pavel A. Exarkhopoulo, The CCUBE Constraint Object-Oriented Database System, Constraints, v.2 n.3-4, p.245-277, 1997
	Alexander Brodsky, Constraint Databases: Promising Technology or Just IntellectualExercise?, Constraints, v.2 n.1, p.35-44, April 1997
	Lavinia Egidi , Paolo Terenziani, A modular approach to user-defined symbolic periodicities, Data & Knowledge Engineering, v.66 n.1, p.163-198, July, 2008
	Lukasz Golab , Theodore Johnson , Nick Koudas , Divesh Srivastava , David Toman, Optimizing away joins on data streams, Proceedings of the 2nd international workshop on Scalable stream processing system, March 29-29, 2008, Nantes, France

INDEX TERMS

Primary Classification:
H. Information Systems
H.2 DATABASE MANAGEMENT

General Terms:
Algorithms, Design, Languages, Management, Performance, Theory, Verification

REVIEW

"Michael Hanspeter Böhlen : Reviewer"

A framework for modeling and handling infinite periodic data is presented in this theoretical paper. The authors motivate generalized relations based on linear repeating points with linear constraints. Classical relational algebra operators ar more...

Collaborative Colleagues:

F. Kabanza: colleagues

J.-M. Stévenne: colleagues

P. Wolper: colleagues

This Article has also been published in:

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

1995 , Nashville, Tennessee, United States

Adobe Acrobat

QuickTime

Windows Media Player

Real Player