2338 search results - page 144 / 468 » Using UML to model relational database operations |
146
click to vote
EDBT
1992
ACM
15 years 9 months ago
1992
ACM
A general technique for merging database schemas is developed that has a number of advantages over existing techniques, the most important of which is that schemas are placed in a...
137
Voted
SIGMOD
2003
ACM
16 years 5 months ago
2003
ACM
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
218
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
162
Voted
SDM
2010
SIAM
15 years 6 months ago
2010
SIAM
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
176
click to vote
ADC
2000
Springer
15 years 9 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...