6004 search results - page 322 / 1201 » Parallelizing query optimization |
198
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
154
Voted
SSDBM
2002
IEEE
15 years 5 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
147
click to vote
EDBT
1992
ACM
15 years 4 months ago
1992
ACM
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
112
Voted
VLDB
1991
ACM
15 years 4 months ago
1991
ACM
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
136
click to vote
GIS
2008
ACM
15 years 1 months ago
2008
ACM
In this paper we study in-network query processing in disconnected mobile environments, where both ad-hoc communication and infrastructure communication are available. Depending o...