Sciweavers

4536 search results - page 217 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SAS
1999
Springer
15 years 6 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 4 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
VLDB
2007
ACM
135views Database» more  VLDB 2007»
15 years 8 months ago
Self-Organizing Schema Mappings in the GridVine Peer Data Management System
GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer – where dat...
Philippe Cudré-Mauroux, Suchit Agarwal, Adr...
ICDT
2007
ACM
133views Database» more  ICDT 2007»
15 years 8 months ago
XML Schema Mappings in the Presence of Key Constraints and Value Dependencies
Abstract. Schema mappings play a central role in both data integration and data exchange, and are understood as high-level specifications describing the relationships between data...
Tadeusz Pankowski, Jolanta Cybulka, Adam Meissner
WISE
2006
Springer
15 years 8 months ago
Efficient Filtering Query Indexing in Data Stream
Filtering queries are widely used in data stream applications. As more and more filtering queries are registered in high-speed data stream management system, the processing efficie...
Ying Wang, Shuo Bai, Jianlong Tan, Li Guo