Sciweavers

1007 search results - page 81 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
ICDCS
2005
IEEE
15 years 12 months ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
IASTEDCCS
2004
121views Hardware» more  IASTEDCCS 2004»
15 years 7 months ago
Performance of hyperspectral imaging algorithms using itanium architecture
This paper describes the experiences and results on implementing a set of hyperspectral imaging analysis algorithms on the Itanium Processor Family. On Itanium architecture all in...
Wilfredo E. Lugo-Beauchamp, Kennie Cruz, Carmen L....
WWW
2011
ACM
15 years 1 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
PVLDB
2010
190views more  PVLDB 2010»
15 years 1 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 6 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan