415 search results - page 31 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
TDM
2004
13 years 9 months ago
2004
This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how extending the Te...
AMW
2010
13 years 10 months ago
2010
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
This paper presents a system for efficient data transformations between XML and relational databases, called XML Data Mediator (XDM). XDM enables the transformation by externalizi...
SSD
2001
Springer
14 years 27 days ago
2001
Springer
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...