Sciweavers

383 search results - page 59 / 77
» Join operations in temporal databases
Sort
View
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 9 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
15 years 10 months ago
Enabling enterprise mashups over unstructured text feeds with InfoSphere MashupHub and SystemT
Enterprise mashup scenarios often involve feeds derived from data created primarily for eye consumption, such as email, news, calendars, blogs, and web feeds. These data sources c...
David E. Simmen, Frederick Reiss, Yunyao Li, Sures...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 2 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
86
Voted
SIGMOD
2004
ACM
164views Database» more  SIGMOD 2004»
15 years 9 months ago
Dynamic Plan Migration for Continuous Queries Over Data Streams
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
ICDE
2006
IEEE
165views Database» more  ICDE 2006»
15 years 3 months ago
Privacy Preserving Clustering on Horizontally Partitioned Data
Data mining has been a popular research area for more than a decade due to its vast spectrum of applications. The power of data mining tools to extract hidden information that can...
Ali Inan, Yücel Saygin, Erkay Savas, Ay&ccedi...