Sciweavers

2229 search results - page 171 / 446
» The Case for Grounding Databases
Sort
View
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
16 years 7 months ago
Evaluating Window Joins over Unbounded Streams
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 7 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
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
DLOG
2007
15 years 8 months ago
Automated Evaluation of Description Logic Reasoning Systems
Abstract. The DL implementation group (DIG) has specified a common interface for description logic reasoner. While the original intention was to make it easier for other tools to ...
Sebastian Wandelt
ICDE
1998
IEEE
153views Database» more  ICDE 1998»
16 years 7 months ago
Flattening an Object Algebra to Provide Performance
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...
Peter A. Boncz, Annita N. Wilschut, Martin L. Kers...