Sciweavers

147 search results - page 21 / 30
» Size Bounds and Query Plans for Relational Joins
Sort
View
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 11 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 12 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
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...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ESA
2008
Springer
94views Algorithms» more  ESA 2008»
13 years 9 months ago
Relative Convex Hulls in Semi-dynamic Subdivisions
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
Mashhood Ishaque, Csaba D. Tóth
TKDE
2008
169views more  TKDE 2008»
13 years 7 months ago
A Cost-Based Approach to Adaptive Resource Management in Data Stream Systems
Data stream management systems need to control their resources adaptively since stream characteristics and query workload may vary over time. In this paper we investigate an approa...
Michael Cammert, Jürgen Krämer, Bernhard...
SPIN
2010
Springer
13 years 5 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric