Sciweavers

498 search results - page 79 / 100
» Term Rewriting
Sort
View
ICDE
1999
IEEE
134views Database» more  ICDE 1999»
15 years 11 months ago
On Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
Davood Rafiei
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
15 years 9 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
15 years 1 months ago
Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
Davood Rafiei, Alberto O. Mendelzon
98
Voted
IJSI
2008
109views more  IJSI 2008»
14 years 9 months ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
ICFP
2008
ACM
15 years 9 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar