{"id":12244,"date":"2021-11-08T20:32:40","date_gmt":"2021-11-09T01:32:40","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12244"},"modified":"2026-06-10T10:04:35","modified_gmt":"2026-06-10T14:04:35","slug":"technical-reports-1999","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1999\/","title":{"rendered":"Technical Reports 1999"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n Technical Reports 1999\n <\/h1>\n \n \n \n\n
\n
Search Reports by Year<\/a><\/div>\n<\/div>\n\n\n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n\n\n
Number<\/th>Title<\/th>Authors<\/th>Date<\/th>Download<\/th><\/tr><\/thead>
TR-99-01<\/td>\n
Rectangular Attribute Cardinality Map: A New Histogram-like Technique for Query Optimization<\/a><\/div>\n<\/td>
\n
B. John Oommen & Murali Thiyagarajah<\/div>\n<\/td>
\n
January 1999<\/div>\n<\/td>
TR-99-01.pdf<\/a><\/td><\/tr>
\n
TR-99-02<\/div>\n<\/td>
\n
Parallel Virtual Memory<\/a><\/div>\n<\/td>
\n
Frank Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari<\/div>\n<\/td>
\n
January 1999<\/div>\n<\/td>
TR-99-02.pdf<\/a><\/td><\/tr>
\n
TR-99-03<\/div>\n<\/td>
\n
Reducing I\/O Complexity by Simulating Coarse Grained Parallel Algorithms<\/a><\/div>\n<\/td>
\n
Frank Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari<\/div>\n<\/td>
\n
January 1999<\/div>\n<\/td>
TR-99-03.pdf<\/a><\/td><\/tr>
\n
\n
TR-99-04<\/div>\n<\/div>\n<\/td>
\n
\n
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
P. Bose, A. Chan, Frank Dehne, M. Latzel<\/div>\n<\/div>\n<\/td>
\n
\n
January 1999<\/div>\n<\/div>\n<\/td>
TR-99-04.pdf<\/a><\/td><\/tr>
\n
\n
TR-99-05<\/div>\n<\/div>\n<\/td>
\n
\n
The Case for the Rectangular Attribute Cardinality Map in Query Optimization: Modeling, Prototype Validation and Testing*<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
Murali Thiyagarajah & B. John Oommen<\/div>\n<\/div>\n<\/td>
\n
\n
February 1999<\/div>\n<\/div>\n<\/td>
TR-99-05.pdf<\/a><\/td><\/tr>
\n
\n
TR-99-06<\/div>\n<\/div>\n<\/td>
\n
\n
Trapezoidal Atribute Cardinality Map: A New Histogram-like Technique for Query Optimization<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
B. John Oommen & Murali Thiyagarajah<\/div>\n<\/div>\n<\/td>
\n
\n
February 1999<\/div>\n<\/div>\n<\/td>
TR-99-06.pdf<\/a><\/td><\/tr>
\n
\n
TR-99-08<\/div>\n<\/div>\n<\/td>
\n
\n
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
E. Caceres, A. Chan, Frank Dehne, G. Prencipe<\/div>\n<\/div>\n<\/td>
\n
\n
November 1999<\/div>\n<\/div>\n<\/td>
TR-99-08.pdf<\/a><\/td><\/tr>
\n
TR-99-09<\/div>\n<\/td>
\n
\n
Load Balanced and Communication Efficient Partitioning Strategies for Parallel Data Cube Generation<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
Z. Chen, Frank Dehne, S. Hambrusch, A. Rau-Chaplin<\/div>\n<\/div>\n<\/td>
\n
\n
November 1999<\/div>\n<\/div>\n<\/td>
TR-99-09.pdf<\/a><\/td><\/tr>
\n
\n
TR-99-10<\/div>\n<\/div>\n<\/td>
\n
\n
Approximation Algorithms for Geometric Shortest Path Problems<\/a><\/div>\n<\/div>\n<\/td>
\n
\n
L. Aleksandrov, A. Maheshwari, J.R. Sack<\/div>\n<\/div>\n<\/td>
\n
\n
October 1999<\/div>\n<\/div>\n<\/td>
TR-99-10.pdf<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

Number Title Authors Date Download TR-99-01 Rectangular Attribute Cardinality Map: A New Histogram-like Technique for Query Optimization B. John Oommen & Murali Thiyagarajah January 1999 TR-99-01.pdf TR-99-02 Parallel Virtual Memory Frank Dehne, W. Dittrich, D. Hutchinson, A. Maheshwari January 1999 TR-99-02.pdf TR-99-03 Reducing I\/O Complexity by Simulating Coarse Grained Parallel Algorithms Frank Dehne, W. Dittrich, […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11593,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-12244","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12244","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12244"}],"version-history":[{"count":5,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12244\/revisions"}],"predecessor-version":[{"id":24649,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12244\/revisions\/24649"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11593"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12244"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=12244"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}