Sciweavers

1007 search results - page 60 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
CIKM
2004
Springer
15 years 6 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
DAC
2009
ACM
15 years 7 months ago
GPU-based parallelization for fast circuit optimization
The progress of GPU (Graphics Processing Unit) technology opens a new avenue for boosting computing power. This work is an attempt to exploit GPU for accelerating VLSI circuit opt...
Yifang Liu, Jiang Hu
SSD
2007
Springer
171views Database» more  SSD 2007»
15 years 8 months ago
Transformation of Continuous Aggregation Join Queries over Data Streams
We address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join ...
Tri Minh Tran, Byung Suk Lee
122
Voted
JCIT
2010
150views more  JCIT 2010»
14 years 9 months ago
Characteristic Description of Coupled Task Sets Based on Design Structure Matrix and Its Optimal Time and Efforts Solution by Ge
The complicated interactions among tasks lead to iterations in product design and development. To maintain the market share, enterprises should effectively manage their product de...
Ting-gui Chen, Chun-hua Ju
149
Voted
IEEECSA
2009
15 years 4 days ago
Improved Query Plans for Unnesting Nested SQL Queries
- The SQL language allows users to express queries that have nested subqueries in them. Optimization of nested queries has received considerable attention over the last few years. ...
Pranav Khaitan, Satish Kumar M, Korra Sathya Babu,...