Sciweavers

1007 search results - page 137 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
ICDCS
2008
IEEE
15 years 9 months ago
Fast Path Session Creation on Network Processors
The security gateways today are required not only to block unauthorized accesses by authenticating packet headers, but also by inspecting connection states to defend against malic...
Bo Xu, Yaxuan Qi, Fei He, Zongwei Zhou, Yibo Xue, ...
206
Voted
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
16 years 3 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
142
Voted
PC
2007
161views Management» more  PC 2007»
15 years 2 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
168
Voted
IPPS
2006
IEEE
15 years 8 months ago
High-performance computing in remotely sensed hyperspectral imaging: the Pixel Purity Index algorithm as a case study
The incorporation of last-generation sensors to airborne and satellite platforms is currently producing a nearly continual stream of high-dimensional data, and this explosion in t...
Antonio Plaza, David Valencia, Javier Plaza
EDBT
2010
ACM
189views Database» more  EDBT 2010»
15 years 7 months ago
Efficient physical operators for cost-based XPath execution
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...