415 search results - page 2 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
DASFAA
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
CIKM
2006
Springer
13 years 8 months ago
2006
Springer
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
GEOINFO
2003
13 years 6 months ago
2003
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 existing...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...