Download All papers and fundng

NAME:
SAKTI PRAMANIK
CITIZENSHIP STATUS: U.S.
ADDRESS:
Department Computer Science and Engineering
2148 Engineering Building
Michigan State University
East Lansing, MI 48824
DEGREES:
Ph. D., Computer Science, December, 1974, Yale University
M.Phil, Computer Science, 1972, Yale University
M.S., Electrical Engineering, 1969, University of Alberta
B. S., Electrical Engineering, 1966, Calcutta University
(University gold medal for achieving the highest grade
among all branches of engineering)
PROFESSOR, Michigan State University
RESEARCH AREAS
1. Big Data and Cloud Computing:
(a) Genome sequence analysis in the Cloud.
(b) Clustering Internet Scale Big Data Sets
(c) Embedding Multi-media Databases, Dimensionality Reduction, Indexing and Querying.
2. Computational Biology and Genome Sequence Databases:
(a) Genome sequence based identification for security systems
(b) Indexing and querying Genome Sequence Databases
(c) Fast Algorithms for Genomic Sequence Classification.
(d) Fast Homology Computation of Very Large Genome Sequences (this
work, not yet published, is likely to have an impact in the field)
(e) Modeling Taxonomic and Phylogenetic Databases
(f ) Multi-Sequence Alignment and Secondary Structures
3. Modelling and Accessing Web Data: Models for Searching, Clustering, and
Querying Web Pages
LARGE SOFTWARE ENGINEERING PROJECT
1. One of the original designers of the prototype restructured No. 1 and 1A
ESS software system at Bell Lab; involved with the project starting from
the requirement phase to the system implementation phase.
2. HICLAS: A database system to support taxonomic nomenclature and phylogenetic information, and to query and compare various taxonomic and
phylogenetic trees. This is an inter-operable database linking several major
existing databases. The PI developed the system with the support of a
post-doctoral fellow, prof. John Beaman of plant biology at MSU and prof.
Jim Beach of plant biology at the university of Kansas and several graduate
students in the computer science department at MSU. (NSF:91-93, 94-96,
96-97).
3. I was the sole PI of the NSF funded Arabidopsis Genome Sequencing
Database Project. A very large database system to support the international effort on sequencing Arabidopsis plant genome. Ten graduate
students of the computer science department at MSU and several professors/researchers from various Universities helped the PI in developing the
system. The system was being used by thousands of genome sequencing
researchers around the world from 1992 through 2001. (NSF: 1991 - 2001)
4. I was the sole PI of the NSF funded Ribosomal Database Project (RDP)
which is now an important database resource accessed by many people all
around the world. The Resource is now located at MSU. Even though I am
not involved with the project any more, my post doc at the time, Dr. Jim
Cole, is the current head of the RDP project (NSF:1995-1998).
FUNDED PROPOSALS
1. National Science Foundation - Information and data management(IIS-III:
Bigdata initiative): ”Box Queries for Sequence Analysis on Large Scale
Genome Databases,”
$8,000.00, 9/1/2014 -8/31/2016
Sakti Pramanik (PI), Titus Brown (COPI)
2. National Science Foundation - Information and data management(IIS-III:
Bigdata initiative): ”Supporting Efficient Discrete Box Queries for Sequence
Analysis on Large Scale Genome Databases,”
$273,419.00, 9/1/2013-8/31/2016
Sakti Pramanik (PI), Titus Brown (COPI)
3. National Science Foundation - Information and data management(IDM):
Research Experience for Undergraduates (REU)
”Supporting Efficient Similarity Searches for Multidimensional Non-ordered
Discrete data Spaces,”
$6,000.00, 9/01/05-8/31/07
Sakti Pramanik (PI)
4. Indian Government Science and Technology Directorate:
Research Collaboration in Multimedia Databases at IIT Kharagpur with
Professor Shamik Sural.
Travel and Living expenses for three trips funded by rhe Government of
India, 2007, 2008, 2009.
Sakti pramanik, Shamik Sural
5. National Science Foundation - Information and data management(IDM):
”Supporting Efficient Similarity Searches for Multidimensional Non-ordered
Discrete Data Spaces,” Collaborative Research.
$356,000.00, 9/01/05-8/31/08
Sakti Pramanik (PI), Qiang Zhu (COPI)
6. National Science Foundation: Bioinformatics
”Performance Studies for Indexing Genome Sequence Databases”
Small sger $14,000, 9/1/02 - 8/31/03
Sakti Pramanik (PI)
7. National Science Foundation: Information and Data Management
”Data Distribution Properties in High Dimensional Euclidean Space and
their Applications in Optimizing Multi-Media Database Accesses”
$100,000.00, 8/1/99 - 7/31/01
Sakti Pramanik (PI)
8. National Science Foundation
”A Biological Database for Plant Genome Research”
$250,201.00, 2/1/97 - 1/31/01
Sakti Pramanik (PI)
9. National Science Foundation
”HICLAS: An Effective Tool for Interoperability Among Taxonomic Database
Systems”
$60,000.00, 8/1/96 - 7/31/97
Sakti Pramanik (PI)
10. National Science Foundation
Supplement for Database Project for Plant Genome Research”
$14,400.00, 8/1/96 -2/30/97
Sakti Pramanik (PI)
11. National Science Foundation
”Moving the Ribosome Database Project (RDP) to a DBMS Foundation”
$321,445.00, 7/1/95 - 6/30/98
Sakti Pramanik (PI)
12. National Science Foundation
”Hierarchic Database Management System and Networking for Systematics
Biology”
$76,000.00, 1/1/94 - 12/31/96
Sakti Pramanik (PI)
13. National Science Foundation
”Arabidopsis Biological Resource Center at MSU”
$305,628.00, 7/1/91 - 8/30/96
Sakti Pramanik (PI)
14. Ford Motor Company
”Integrated Manufacturing Information Management and Processing System”
$57,644.00, 1/1/94 - 8/31/95
Sakti Pramanik (PI)
15. National Science Foundation
”Large-Scale sequencing of Arabidopsis cDNAs”
$501,615.00 , 8/15/93 - 1/31/95
Tom Newman (PI)
Sakti Pramanik, and several others are CO-PI
16. National Science Foundation
”Hierarchic Database Structures for Taxonomic Data,”
$188,111.00, 7/1/91 -12/31/93
Sakti Pramanik (PI), John Beaman (CO-PI)
17. USDA/CIESIN
”Spatio-emporal Database for Global Change Applications”
$9,900.00, 6/1/92 - 12/31/92
Sakti Pramanik (PI)
18. Naval Research Laboratories
”Parallel Processing of Main Memory Databases”
$30,000.00, 6/14/87 - 9/15/88
Sakti Pramanik (PI)
19. National Science Foundation
” Parallel Processing of Multi-Directory Hashing”
$81,563.00, 1/1/88 - 12/31/89
Sakti Pramanik (PI)
20. U. S. Army Missile Commands
”Data Distribution and Data Construction Strategies for Multi-Processor
Database Systems,”
$10,000.00, 6/1/88 - 9/15/88
Sakti Pramanik (PI)
REFEREED PUBLICATIONS IN COMPUTATIONAL BIOLOGY:
1. Stuart King, Yanni Sun, Jim Cole, Sakti Pramanik,”PFAM TREE:Fast Filtering for Genomic Sequence Classification,” IEEE International Conference
on Bioinformatics and Bioengineering (BIBE 2010), May 31- June 3, 2010,
Philadelphia, PA
2. Qiang Xue, Jim Cole and Sakti Pramanik, ”Sequence Homology Search
Based on Database Indexing Using the Profile Hidden Markov Model,”
IEEE International Conference on Bioinformatics and Bioengineering (BIBE06),
Washington, DC, October 16-18, 2006.
3. Yang Zhong, Yining Luo, S. Pramanik, J. Beaman, ”HICLAS: A taxonomic
database systems for comparing biological classification and phylogenetic
trees,” Bioinformatics journal, February 1999.
4. Bonnie Maidak, James Cole, James Tidje, Sakti Pramanik, et.al., ”A New
Version of the Ribosomal Database Project,” Nucleic Acids Research, Vol.
27, No.1, 1999
5. N. Larsen, R. Overbeck, S. Pramanik, J. Tiedje, O. Strunk, A. Selkov,
”Towards Microbial Data Integration,” Journal of Industrial Microbiology,
1997, Vol. 18, 68-72.
6. Pramanik, S., Zhong, Y., Jung, S. and Beaman, J. H, HICLAS: A database
system based on new data models for biological classification and phylogeny.
Classification and Data Analysis: Proceedings of the International Federation of the Classification Society, IFCS-98 Conference, July 21 - 24, 1998,
Roma, Italy.
7. Zhong, Y., Jung, S., Pramanik, S. and Beaman, J. H. 1997. The query
methods and algorithms for comparing biological classifications and phylogenetic trees in a taxonomic database system. Classification and Data
Analysis: Proceedings of the International Federation of the Classification
Society, IFCS-98 Conference, July 21 - 24, 1998, Roma, Italy.
8. Yang Zong, Christopher A. Meacham, Sakti Pramanik, ”A General Method
for Tree-Comparison based on Subtree Similarity and its Use in a Taxonomic
Database” BIOSYSTEMS, Vol. 42, No. 1, pg 1-8, April 1997
9. Jin Kim, James Cole, Sakti Pramanik, ”Alignment of Possible Secondary
Structures in Multiple Sequences Using Simulated Annealing,” Journal of
the CABIOS (Computer Applications in BIOlogical Sciences) Vol 12, No.
4, pg 259-267, 1996
10. Jin Kim, Jim Cole, Eric Torng, Sakti Pramanik, ”Inferring Relatedness
of Macromolecules,” The Fourth International Conference on Intelligent
Systems for Molecular Biology, (ISMB-96), Washington University, 1996
11. Sakti Pramanik, John Beaman, Yang Zhong, Sungwon Jung, ”Data models
and Query Methods for Interacting Classifications in a Taxonomic Database,”
TAXON, Vol. 45, No. 2, May 1996
12. Sakti Pramanik, Sungwon Jung, Steve Perkins, John Beaman, Yang Zhong
”A New Datamodel for Biological Classification,” Journal of the CABIOS
(Computer Applications in BIOlogical Sciences), Vol. 11, N0. 3, 1995,
(237-246)
13. Jin Kim, M. Chung, Sakti Pramanik, ”Multi Sequence Alignment Using
Simulated Annealing,” Journal of the CABIOS (Computer Applications in
BIOlogical Sciences) Vol 10, No. 4, 1994
14. Jin Kim, Sakti Pramanik, ”An Efficient Method for Multiple Sequence
Alignment,” The Second International Conference on Intelligent Systems
for Molecular Biology, (ISMB-94) August 15, 1994, Stanford University
15. Sakti Pramanik, Jim Beach, John Beaman, ”Hierarchic Structures for Taxonomic Database Systems.” Advances in Computer Methods for Systematic
Biology; Artificial Intelligence, Databases, Computer Vision; Editor Renaud
Fortuner, John Hopkins University Press, 1993.
REFEREED PUBLICATIONS IN COMPUTER SCIENCE:
16. Watve Alok , Sakti Pramanik, Salman Shahid,Meiners Chad ,
Liu Alex, ”Topological Transformation Approach to Database
Query Processing, IEEE-Transactions on Knowledge and Data
Engineering, Accepted for Publication in 2015.
17. Pramanik, Sakti , Kolbe Dashell , Zhu Qiang, ”k-Nearest Neighbor Searching in Hybrid Space,” Information Systems Journal,
Vol 43, PP 55-64, 2014.
18. Alok Watve, Sakti Pramanik, Sungwon Jung, Bumjoon Jo,
Sunil Kumar, Shamik Sural, ” Clustering Non-Ordered Discrete Data,”Journal of Information Science and Engineering,
Vol 30, PP. 1-23, 2014.
19. Changqing Chen, Alok Watve, Sakti Pramanik, Qiang Zhu,
”The BoND-tree: An Efficient Indexing Method for Box Queries
in Non-ordered Discrete Data Spaces,” IEEE Transactions on
Data and Knowledge Engineering, Vol. 25, Issue 11, pp. 26292643, November 2013.
20. Salman Shahid, Sakti Pramanik, Charles Owen, ”Minimum
Bounding Boxes for Regular Cross-Polytopes,” Proceedings of
the ACM-SAC, Rome, Itally, March 26-29, 2012.
21. Sakti Pramanik, Alok Watve, Chad Miners, Alex Liu, ”Transforming Range Queries To Equivalent Box Queries To Optimize
Page Accesses,” Proceedings of the 36th. International Conference on Very Large Databases (VLDB 2010), Page 409-416,
Singapore, September 13-17, 2010.
22. Dashiell Kolbe, Qiang Zhu, Sakti Pramanik, ”Efficient K- Nearest Neighbor Searching in Non-ordered Discrete Data Spaces,”
ACM Transactions on Information Systems (TOIS), Vol 28, Issue 2, May 2010
23. Dashiell Kolbe, Qiang Zhu, Sakti Pramanik, ”Reducing NonDeterminism of k-NN Searching in Non-Ordered Discrete Data
Spaces,” Journal of the Information Processing Letters (IPL),
volume 110, issue 10, April 2010, pages 420-423,
24. Rahul Gupta, Soumya K. Ghosh, Shamik Sural and Sakti Pramanik, ”Hybrid Index based Image Search from the Web, International Journal of Data Mining, Modelling and Management
(IJDMMM).
25. Hyun Jeong Seok, Gang Qian, Qiang Zhu, Sakti Pramanik,
”Deletion Techniques for the ND-tree in Non-ordered Discrete
Data Spaces,” accepted to 18th International Conference on
Software Engineering and Data Engineering, June 22 - 24, 2009,
Las Vegas, Nevada, USA, Las Vegas, ponsored by the International Society for Computers and their Applications (ISCA).
26. Changqing Chen, Sakti Pramanik, Qiang Zhu, Alok Watve,
Gang Qian, ”The C-ND Tree: A Multidimensional Index for
Hybrid Continuous and Non-ordered Discrete Data Spaces ,”
EDBT-2009, Saint-Petersburg, Russia, March 23-26.
27. Changqing Chen, Sakti Pramanik, Qiang Zhu and Gang Qian,
”A Study of Indexing Strategies for Hybrid Data Spaces,” Proceedings of the 11th International Conference on Enterprise Information Systems (ICEIS’09), pp 149-159, Milan, Italy, May
6-10, 2009.
28. Sunil Kumar, Shamik Sural, Alok Watve, Sakti Pramanik, ”CNODE: Clustering of set-valued non-ordered discrete Data,” Int.
J of Data Mining, Modeling and Management, 2009-Vol 1, No.
3, pp. 310-334.
29. Seok, H.-J., Q. Zhu, G. Qian, S. Pramanik and W.-C. Hou.”Deletion
Techniques for the ND-tree in Non-ordered Discrete Data Spaces,”
Proc. of SEDE’09, pp. 1-6, 2009.
30. Gang Qian, Hyun Jeong Seok,Qiang Zhu, Sakti Pramanik,”
Space-Partitioning-Based Bulk-Loading for the NSP-tree in Nonordered Discrete Data Spaces,” DEXA-2008, Springer-Verlag,
pp. 404-418.
31. Hyun Jeong Seok, Gang Qian, Qiang Zhu, Sakti Pramanik,
”Bulk-Loading the ND-tree in Non-ordered Discrete Data Spaces,”
DAASFA-2008, (Best Paper Award), 13th. International Conference on Systems for Advanced Applications, March 19, New
Delhi, India.
32. Dashiell Kolbe, Qiang Zhu and Sakti Pramanik, ”On k-Nearest
Neighbor Searching in Non-Ordered Discrete Data Spaces,”
IEEE International Conference on Data Engineering (ICDE07), Istanbul, Turkey, April 16-20, 2007.
33. Gang Qian, Qiang Zhu, Qiang Xue and Sakti Pramanik, ”A
Space-Partitioning-Based Indexing Method for Multidimensional
Non-Ordered Discrete Data Spaces”, ACM Transactions on Information Systems, Vol. 23, No. 1, 2006
34. Xu, Q., S. Pramanik, G. Qian and Q. Zhu. ”The hybrid digital
tree: a new indexing technique for large string databases,”Enterprise
Information Systems VII (Selected Best Papers of ICEIS’05),
pp 45-51, 2006.
35. Gang Qian, Qiang Zhu, Qiang Xue and Sakti Pramanik, ”A Dynamic Indexing Technique for Multidimensional Non-Ordered
Discrete Data Spaces”, ACM Transactions on Database Systems, Vol. 31, No. 2, 2006.
36. Sungwon Jung, Byungkyu Lee, Sakti Pramanik. A Tree-Structured
Index Allocation Method with Replication over Multiple Broad-
cast Channels in Wireless Environments,IEEE Transactions on
Knowledge and Data Engineering, Vol. 17, No.4, April 2005
37. Qiang Xue, Sakti Pramanik, Gang Qian and Qiang Zhu. A
Hybrid Index Structure for Querying Large String Databases.
International Journal of Electronic Business, Vol. 3, No. 3,
March 2005.
38. Qiang Xue, Sakti Pramanik, Gang Qian and Qiang Zhu. The
Hybrid Digital Tree: a new indexing technique for large string
databases. Proc. of 7th ICEIS, Miami, USA, June 2005.
39. Gang Qian, Shamik Sural, Yuelong Gu and Sakti Pramanik.
”Similarity between Euclidean and cosine angle distance for
nearest neighbor queries”, Proceedings of the 19th Annual ACM
Symposium on Applied Computing (SAC 2004), March 2004
40. Gang Qian, Qiang Zhu, Qian Xue and Sakti Pramanik, ”The
ND-Tree: A Dynamic Indexing Technique for Multidimensional
Non-ordered Discrete Data Spaces,” Proc. of 29th Int’l Conf.
on Very Large Data Bases (VLDB’03), pp 620 - 631, Sept. 2003
41. Sungwon Jung, Sakti Pramanik ”An Efficient Path Computation Model for Hierarchically Structured Topographical Road
Maps” IEEE Transactions on Data and Knowledge Engineering, August 2002.
42. Qian gang, Shamik Sural, Sakti Pramanik ”A comparative analysis of two distance measures in color image databases” International Conference on Image Processing(ICIP-02), Rochester,
NewYork, September 22, 2002.
43. Shamik Sural, Qian Gang, Sakti Pramanik ”Segmentation and
histogram generation using the HSV color space for image retrieval” International Conference on Image Processing (ICIP02), Rochester, NewYork, September 22, 2002.
44. Shamik Sural, Qian gang, Sakti Pramanik ”A histogram with
perceptually smooth color transition for image retrieval” the
International Conference on Computer Vision, Pattern Recognition & Image Processing, 2002 (CVPRIP’2002)
45. Sakti Pramanik, Jinhua Li ”Clustered AB-Tree,” IEEE International Conference on Multimedia and Expo, Tokyo, japan,
June 25, 2001.
46. Sakti Pramanik, Jinhua Li, Jiandong Ruan, ”Performance Analysis of AB-tree,” IEEE International Conference on Multimedia
and Expo 2000, New York City, July 31, 2000.
47. Sakti Pramanik, Jinhua Li, Jiandong Ruan, ”Physics of High
Dimensional Data Sets in Euclidean Space and Their Applications,” Invited Paper, SSGRR-2000, L’Aquila, Italy, July 31,
2000.
48. Sakti Pramanik, Jinhua Li, Jiandong Ruan, Sushil Bhattacharjee, ”An Efficient Search Scheme for Very Large Image Databases,”
Proceedings of SPIE, Internet Imaging, San Jose, January 2000.
49. Sakti Pramanik, Scott Alexander, Jinhua Li, ”An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in
High Dimensions,” Proceedings, IEEE Multimedia Systems,
page 865-869, June 7-11, Florence, Italy, 1999.
50. Sakti Pramanik, Jinhua Li, ”Fast Approximate Search Algorithm for nearest neighbor queries in high dimension,” IEEE
international conference on data engineering,(abstract) Sydney,
Australia, March 1999
51. Sakti Pramanik, Nasser Assem, S. Choudhury, S. Bhattacharya,
”Graph Theoretic Modelling of semi-structured information
system based on functional abstraction,” Proceedings of the
IASTED international conference, Hawaii, August 1998.
52. Chongstitvatana J. E, and Sakti Pramanik, ”Extending Relational Algebra to Incorporate Characteristics of Temporal
Data, International Workshop on Issues and Applications of
Database Technology,” (IADT’98), Berlin, Germany, July 6-9,
1998.
53. Jaruloj Eamsiri and Sakti Pramanik,”A Design Principle for
Temporal Databases With Homogeneous and Non-homogeneous
Temporal Data,” Computer Science Technical Report: db97-1,
June 16, 1997
54. Sungwon Jung, Sakti Pramanik, ”Description and Identification of Distributed Fragments of Recursive Relations” IEEE
Transactions on Knowledge and Data Engineering, Vol. 8, No.
6, pg 1002-1016, 1996
55. Walid Tout, Sakti Pramanik, ”The NUMA with Clusters of
Processors for Parallel Join” IEEE Transactions on Knowledge
and Data Engineering, Vol. 9, No. 4, pg. 653-660, 1997
56. Jaruloj Eamsiri, Sakti Pramanik, ”Exploiting the Characteristics of Domain Dependent Data in Relational Databases,”
International Conference on Intelligent Information Systems,
Washington, D.C. June 5-7, 1996
57. Sungwon Jung, Sakti Pramanik, ”HiTi Graph Model of Topographical Road Maps in Navigation Systems” IEEE International Conference on Data Engineering, February 27, 1996
58. Analyti Anastasia, Sakti Pramanik, ”Reliable Semantics for Extended Logic Programs with Rule Prioritization”, Journal of
Logic and Computation, Vol. 5, No. 3, 1995 (303-323)
59. Walid Tout, Sakti Pramanik, ”Main Memory Hash-Based Join
Algorithms for Multiprocessors with NUMA Architectures,”
IEEE Transactions on Parallel & Distributed Systems, Volume
6, Number 8, August 1995, pp. 841-849.
60. Sungwon Jung, Sakti Pramanik, ”An Efficient Representation
of Distributed Fragments of Recursive Relations,” Fourth International Conference on Database Systems for Advanced Applications (DASFAA’95), April 9, 1995, (397-404)
61. Jaruloj Eamsiri, Sakti Pramanik ”Temporal Datalog: A Temporal Logic database with Generalization Rules,” CISMOD 94,
Madras, India
62. Analyti Anastasia, Sakti Pramanik, ”Declarative Semantics for
Contradictory Modular Logic Programs,” Eighth International
Symposium on Methodologies for Intelligent System (ISMIS
94), October 16, 1994, University of North Carolina
63. Analyti Anastasia, Sakti Pramanik, ”Semantics for Reasoning with Contradictory Extended Logic Programs,” 1994 Joint
Conference on Declarative Programming GULP-PRODE’94,
Universidad Politecnica de Valencia, Spain
64. Analyti Anastasia, Sakti Pramanik, ”Reliable Semantics for Extended Logic Programs with Rule Prioritization,” Workshop on
Logic Programming with Incomplete Information, Vancouver,
Canada, October 1993
65. Sakti Pramanik, Analyti Anastasia, Henry Davis, Hsiao Yu
Chou, ”Multi Directory Hashing”, Information Systems, January 1993
66. Analyti Anastasia, Sakti Pramanik, ”Performance Analysis of
a Main Memory Multi-Directory Hashing Technique”, Journal
of the Information Processing Letters, March 1993
67. Walid Tout, Sakti Pramanik, ”A Distributed Load Balancing
Scheme for Data Parallel Applications”, International Conference on Parallel Processing, August 1993
68. Vasu Vuppala, Vishram Patwardhan, Sakti Pramanik, ”2-3 Phase
Commit Protocols”, CISMOD-93, New Delhi, India.
69. Farshad Fotouhi, ”Join and Semijoin Algorithms Based on PartialRelation Schemes”, The Computer Journal, February 1992
70. Myoungho Kim, Sakti Pramanik, ” Parallel Processing Models
for Database Systems”, The Computer Journal, 1992
71. Sakti Pramanik, Analyti Anastasia, ”Query Processing in Databases”
Macmillan Encyclopedia of Computers, Invited Contributor,
1992
72. Analyti Anastasia, Sakti Pramanik, ”Optimal Hash Based Search
for Main Memory Databases,” SIGMOD, May 1992
73. Sakti Pramanik, David Kao, David Vineyard, ”Fragmentation
of Recursive Relations in Distributed Databases,” Extending
Data Base Technology (EDBT), Vienna, Austria, March 1992
(389-404)
74. Sakti Pramanik and Myoungho Kim ”The FX Distribution
Method for Parallel Processing of Partial Match Queries,” Journal of the Information processing letters, June 1991
75. Sakti Pramanik and Farshad Fotouhi ”Problem of Optimizing
the Number of Block Accesses in Performing Relational Join,”
Journal of the Information Processing Letters, June 1991
76. Sakti Pramanik, Charles Severance, Tod Rosenau, ”A High
Speed Main Memory File System for shared memory MultiProcessor Systems”, IEEE Special Issue on Databases: Theory,
Design and Applications, IEEE Computer Society Press, 1991,
N. Rishe, S. Navathe and D. Tal (eds.), pp. 187-203
77. Sakti Pramanik, Charles Severance and Paul Wolberg. ”Distributed Linear Hashing.” International Conference on Parallel
Processing, August 1990
78. Sakti Pramanik, Charles Severance and Paul Wolberg. ”Distributed Linear Hashing and Parallel Projection in Main Memory Databases.” International Conference on Very Large Databases,
August 1990 (VLDB-90)
79. Sakti Pramanik, Myoungho Kim,”HCB tree: A Height Compressed B-tree for Parallel Processing,” IEEE Transactions on
Computers, Vol. 39, No. 9, September 1990
80. R. Williamson, S. Pramanik, J. Kim, J. Jackson ”Adaptation
of a Matrix for Quantitative Assessment of Sequence Similarity”, Converging Approaches in Computational Biology, 1990
Albany Conference, Sept. 13-16, 1990
81. Sakti Pramanik, Myoungho Kim, ”Database Processing Models
in Parallel Processing Systems”. International Workshop on
Database Machines (IWDM), June 1989
82. Sakti Pramanik, Myoungho Kim, ”On the Data Distribution
Problems for Range Queries, International Conference on Parallel Processing,” August, 1989
83. Sakti Pramanik, Farshad Fotouhi, ”Optimal Secondary Storage
Access Sequence for Performing Relational Join”, IEEE Transactions on Data & Knowledge Engineering, Vol. 1, No.3, (pp.
318-325), October 1989.
84. RANKED among the top three best papers accepted for SIGMOD88;
Sakti Pramanik & Myoungho Kim, ”Optimal File Distribution
for Partial Match Retrieval”, ACM SIGMOD, pg 173-182, June
1988
85. Sakti Pramanik & David Vineyard, ”Optimizing Join Queries
in Distributed Databases”, IEEE Transactions on Software Engineering, September 1988.
86. Sakti Pramanik & Myoungho Kim, ”HCB tree: A Height Compressed Btree for Parallel Processing”, The Journal of the Information Processing Letters, November 1988.
87. Sakti Pramanik & Myoungho Kim, ”Generalized Parallel Processing Models for Database Systems”, International Conference on Parallel Processing, August 1988.
88. Sakti Pramanik & Farshad Fotouhi, ”Optimizing the Cost of
Relational Queries Using Partial Relational Schemes”, Information Systems, Volume 13, Number 1, 1988
89. Sakti Pramanik & David Vineyard, ”Optimizing Join Queries
in Distributed Databases”, Lecture notes in Computer Science,
Vol. 287, Springer Verlag, 1987
90. Sakti Pramanik & Myoungho Kim, ”HCB tree: A B-tree Structure for Parallel Processing”, Proceedings of the International
Conference on Parallel Processing, August 1987
91. Sakti Pramanik, ”A Parallel Hardware Algorithm to Perform
Relational SemiJoin,” Proceedings of the 20th. Hawaii International Conference on System Sciences, January 6, 1987
92. Sakti Pramanik & Farshad Fotouhi, ”Join and Semijoin Algorithms Based on Partial- Relation Schemes”, Proceedings of the
6th Advanced Database Systems Symposium, Tokyo, Japan,
August 29, 1986
93. Sakti Pramanik & Farshad Fotouhi, ”Index Database Machines”,
The Computer Journal, Vol. 29, No. 5, October 1986
94. Sakti Pramanik ”Performance Analysis of a Database Filter
Search Hardware”, IEEE Transactions on Computers, Vol. 35,
No. 12, December 1986.
95. Sakti Pramanik & Farshad Fotouhi, ”An Index Database MachineAn Efficient M-way Join Processor”, AFCET Information Congress
- Hardware and Software Components and Architectures for
the 5th. Generation - Conference Proceedings, INRIA, Paris,
March 1985
96. Sakti Pramanik & Chung-Ta King, ”A Hardware Pattern Matching Algorithm on a Dataflow”, The Computer Journal, Vol. 28,
No. 3, August 1985
97. Sakti Pramanik & David Ittner, ”Use of Graph Theoretic Model
for Optimal Relational Database Accesses to Perform Join”,
ACM Transactions on Database Systems, Vol. 10, No. 1,
March 1985
98. Sakti Pramanik & David Ittner, ”A Solution to the General
Maximum Cut Problem”, Proceedings of the Conference on
Information Sciences and Systems, Department of Electrical
Engineering and Computer Science, Princeton University, 1984
99. Sakti Pramanik,”Implementing Set Theoretic Relational Query
Functions Using Highly Parallel Index Processing Hardware,”
AFIPS National Computer Conference Proceedings, Vol. 52,
1983
100. Sakti Pramanik, ”Database Filters”, The Proceedings of the
9th Annual Symposium on Computer Architecture”, Austin,
Texas, April 1982.
101. Sakti Pramanik, ”Hardware Organization for Non-numeric Processing”, Proceedings of the International Conference on Very
Large Databases, Cannes, France (VLDB-81)
102. Sakti Pramanik, ”Highly Parallel Associative Search and its
Application to Cellular Database Machine Design”, AFIPS National Computer Conference, Vol. 50, 1981
103. Sakti Pramanik, ”A Mathematical Model of Character String
Manipulation”, AFIPS National Computer Conference, Vol.
49, 1980
104. Sakti Pramanik & E. T. Irons, ”A Data-Handling Mechanics of
On-line Text Editing Systems with Efficient Secondary Storage
Accesses”, AFIPS National Computer Conference Proceedings,
Vol. 48, 1979.
OTHER PUBLICATIONS
1. BernieWeinberg, Sakti Pramanik, ”An Implementation Kit with Monitors”,
ACM SIGPLAN NOTICES, September 1984
2. Sakti Pramanik, ”Restructured Program Brass Board Experiments: Database
Management System Descriptions for No. 1 and 1A ESS”, BELL LAB REPORT #5354-770914.01F, 1977
MAJOR DATABASES DEVELOPED
1. AIMS: A very large database system to support the international effort on
plant genome research. This is an NSF supported project.
2. HICLAS: A database system to support taxonomic nomenclature and phylogenetic information, and to query and compare various taxonomic and
phylogenetic trees. This is an inter-operable database linking several major
existing databases. This is an NSF supported Project.
3. RDP Database: An Object Oriented Database Developed Using ObjectStore database system. This is a large ribosomal Sequence database. This
is an NSF supported project.
Ph.D. STUDENTS GRADUATED
1. Farshad Fotouhi, March 1988
”Optimizing Join Algorithms in Relational Database Systems”
2. Myoungho Kim, February 1989
”Data Distribution Strategies for Parallel Database Accesses”
3. David Ray Vineyard, August 1989
”Query Optimization in Distributed Databases by Predicate Analysis and
Semijoin Techniques”
4. Walid Tout, August 1994
”Parallel Hash Join with Skew Handling on Multiprocessor Systems”
5. Anastasia Analyti, August 1994
”Reasoning with Contradictory Deductive Databases”
6. Sungwon Jung, December 1995
”Recursive Query Processing in Large Databases”
7. Jin Kim, February 1996.
”Relatedness of Biological Sequences Using Alignment and Restriction Map
Databases”
8. Jaruloj Eamsiri Chongstitvatana, December 1997.
”A Data Model and Design Principles for Temporal Databases with Homogeneous and Non-homogeneous Data”
9. jinhua Li, 2001. ”Efficient Similarity Search on Data Distribution Properties
in High Dimensions”
10. Assem Nasser, 2002 ”Ontology-based Similarity for Clustering in Text Space”
11. Gang Qian, 2004 ”Principles and Applications for Supporting Similarity
Queries in Non-Ordered-Discrete and Continuous Data Spaces”
12. Qiang Xue, 2005 ”The Hybrid Digital Tree and its Applications to Genomic
Sequence Databases”
13. Changqing Chen, 2009
”Indexing of Multidimensional Discrete Data Spaces and Hybrid Extensions”
14. Dashiell Kolbe, 2010
”Techniques for Efficient K-Nearest Neighbor Searching in Non-Ordered
Discrete and Hybrid Data Spaces”
15. Alok Watve, 2012
”Data Transformation for Improved Query performance”
16. Salman Shahid, 2014
”Finding Optimized Bounding Boxes of Polytopes in D-dimensional Space
and Their Properties in K-Dimensional Projections”
CURRENT Ph.D. STUDENTS
Tuhid Islam
Vahid Mirjalili
MS with THESIS
Charles Severence, 1990
Stuart King, 2006
TEACHING AWARD
1. Teaching award by the student body of Computer Science Department at
Michigan State University, 1985
2. Teacher of the Year Award, ACM Chapter and Computer Science Department, Jackson State University, 1978
COURSES TAUGHT
Database Courses:
1. CPS 480: Database Systems, a senior level database course.
2. CPS 880: Advanced Databases, a graduate course in database systems.
3. CPS 483, CPS 484: Database Systems; a two term course on Software
Engineering Concepts for Developing a Database System, Junior/Senior
level data base course.
4. CPS 890: Distributed and Parallel database Systems, second graduate
course in database Systems.
5. CPS 980: Selected Topics in Database Systems; Logic Systems & Databases
6. CPS 980: Selected Topics in Database Systems; Indexing Multi-Media
Databases
7. CPS 490/ENT 401: Concepts of Biological Information Systems, with Professor Stuart Gage of Biological Sciences
Other Courses Taught:
1. Data Structures and Algorithms, Junior/Senior level course
2. Formal language theory, Junior level course.
3. Compilers, Senior level course.
4. Programming Languages, Junior level course.
5. Operating Systems, Senior level course.
6. Discrete Structures, Sophomore level course.
INSTITUTIONAL SERVICES
1. Member, All University Faculty Awards Committee, Michigan State University
2. Chair, Faculty Search Committee, Computer Science Department
3. Chair, Graduate Studies and Research Committee, Computer Science Department
4. Member, the Engineering College Advisory Committee
5. Member, the Engineering College Undergraduate Scholarship Committee
6. Chair, College of Engineering Graduate Studies Committee- 9/2/2009-5/7/2010
7. Member of Various Computer Science Department Committees, such as
the Tenure and Promotion Committee, Computing Services Committee and
Graduate Studies and Research Committee.
PUBLIC SERVICES
1. Member 2014 Review Panel: National Cancer Institute- Cloud Pilot
2. Member of the Editorial Board, Int. J. of Data Mining, Modeling and
Management (http://www.inderscience.com).
3. Associate Editor of the International Journal of Computers and their Applications (IJCA), established in 1994 and is indexed in INSPEC and DBLP.
4. Committee Member, IEEE Data Engineering Conference, 1989, 1990, 1991,
1994, 1995
5. Member, DOE Review Panel for Databases for Human Genome Projects,
1994
6. Member, NSF Review panel (Information and Datamanagement), 1993,
1999, 2001, 2002
7. Panel Member, Scientific databases, Fourth International Conference on
Foundation of Data Organization and Algorithms, FODO-1993
8. Member, NSF review Panel on Scientific Databases, 1992
9. Moderator, Panel on Genomic Databases for Human Genome project at the
IEEE International Conference on Data Engineering, Kobe, Japan, 1991
10. Session Chair, IEEE Data Engineering Conference, 1989, 1990, 1995, 99,
IEEE Multimedia conference 1999.
11. Committee Member, IEEE & ACM sponsored Parallel and Distributed Information Systems, 1990