710 search results - page 36 / 142 » Efficiency of Nested Relational Document Database Systems |
139
click to vote
CC
2006
Springer
15 years 5 months ago
2006
Springer
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
211
click to vote
DEBU
2007
15 years 1 months ago
2007
The volume of information in natural languages in electronic format is increasing exponentially. The demographics of users of information management systems are becoming increasin...
191
click to vote
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do ...
125
click to vote
SSDBM
2003
IEEE
15 years 6 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...
155
click to vote
DASFAA
2004
IEEE
15 years 5 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...