Sciweavers

4536 search results - page 36 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDE
1999
IEEE
91views Database» more  ICDE 1999»
14 years 9 months ago
Real-Time Data Access Control on B-Tree Index Structures
This paper proposes methodologies to control the access of B-tree-indexed data in a batch and real-time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-...
Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam
ICPP
1994
IEEE
13 years 11 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
SCM
2003
13 years 9 months ago
Merging Collection Data Structures in a Content Management System
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
Axel Wienberg
TMM
2002
130views more  TMM 2002»
13 years 7 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang
DASFAA
2011
IEEE
206views Database» more  DASFAA 2011»
12 years 11 months ago
A Hybrid Algorithm for Finding Top-k Twig Answers in Probabilistic XML
Abstract. Uncertainty is inherently ubiquitous in data of real applications, and those uncertain data can be naturally represented by the XML. Matching twig pattern against XML dat...
Bo Ning, Chengfei Liu