Query processing over object views of relational data
โ Scribed by Gustav Fahl; Tore Risch
- Publisher
- Springer-Verlag
- Year
- 1997
- Tongue
- English
- Weight
- 444 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1066-8888
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This article applies range query theory to develop join algorithms that run in O(I log d I+U) time, where I and U are the sizes of the input and output and d is usually a small constant. One advantage of these algorithms is that they do not require the storage of an index, and they also use a workin
When data are obtained from heterogeneous distributed information sources, all of the data do not always have the same structure, but they are sometimes different in data structure from instance to instance. As a data structure to integrate such semistructured data, we present the self-descriptive o