Sciweavers

1007 search results - page 80 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
DEXA
1995
Springer
126views Database» more  DEXA 1995»
15 years 6 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
IPPS
2000
IEEE
15 years 7 months ago
Parallel Information Retrieval on an SCI-Based PC-NOW
This paper presents an efficient parallel information retrieval (IR) system which provides fast information service for the Internet users on lowcost high-performance PC-NOW enviro...
Sang-Hwa Chung, Hyuk-Chul Kwon, Kwang Ryel Ryu, Ha...
IPPS
2010
IEEE
15 years 28 days ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
COR
2007
106views more  COR 2007»
15 years 3 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
CONCUR
2009
Springer
15 years 9 months ago
Query-Based Model Checking of Ad Hoc Network Protocols
Abstract. A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the fact that the number of network topologies grows exponentially with the squ...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka