Sciweavers

88 search results - page 10 / 18
» Object-Oriented Programming with Recursive Queries
Sort
View
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
14 years 1 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
FOCS
1991
IEEE
14 years 1 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 11 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang
ER
2008
Springer
110views Database» more  ER 2008»
13 years 11 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
ICDT
2009
ACM
119views Database» more  ICDT 2009»
14 years 10 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose