default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSakti Pramanik
Person information
- affiliation: Michigan State University, East Lansing, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c52]A. K. M. Tauhidul Islam, Sakti Pramanik:
Fast Edit Distance Prediction for All Pairs of Sequences in Very Large NGS Datasets. PKDD (4) 2024: 72-91- 2020
- [j44]Xianying Liu
, Qiang Zhu, Sakti Pramanik, C. Titus Brown, Gang Qian:
VA-Store: A Virtual Approximate Store Approach to Supporting Repetitive Big Data in Genome Sequence Analyses. IEEE Trans. Knowl. Data Eng. 32(3): 602-616 (2020) - [j43]Hyeong-Cheol Ryu, Sungwon Jung, Sakti Pramanik:
An Effective Clustering Method over CF$^+$+ Tree Using Multiple Range Queries. IEEE Trans. Knowl. Data Eng. 32(9): 1694-1706 (2020) - [c51]Ramblin Cherniak, Qiang Zhu, Sakti Pramanik:
A Study of Update Methods for BoND-Tree Index on Non-ordered Discrete Vector Data. CATA 2020: 122-133
2010 – 2019
- 2019
- [j42]A. K. M. Tauhidul Islam, Sakti Pramanik, Qiang Zhu:
The BINDS-Tree: A Space-Partitioning Based Indexing Scheme for Box Queries in Non-Ordered Discrete Data Spaces. IEICE Trans. Inf. Syst. 102-D(4): 745-758 (2019) - [j41]Alok Watve, Sakti Pramanik, Sungwon Jung, Chae Yong Lim:
Data-independent vantage point selection for range queries. J. Supercomput. 75(12): 7952-7978 (2019) - 2018
- [c50]Sakti Pramanik, A. K. M. Tauhidul Islam, Shamik Sural:
Predicted Edit Distance Based Clustering of Gene Sequences. ICDM 2018: 1206-1211 - 2017
- [c49]A. K. M. Tauhidul Islam, Sakti Pramanik, Vahid Mirjalili, Shamik Sural:
RESTRAC: REference Sequence Based Space TRAnsformation for Clustering. ICDM Workshops 2017: 462-469 - [c48]Ramblin Cherniak, Qiang Zhu, Yarong Gu, Sakti Pramanik:
Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data Spaces. IDEAS 2017: 153-160 - 2015
- [j40]Alok Watve, Sakti Pramanik, Salman Shahid, Chad R. Meiners, Alex X. Liu:
Topological Transformation Approaches to Database Query Processing. IEEE Trans. Knowl. Data Eng. 27(5): 1438-1451 (2015) - [c47]Yarong Gu, Xianying Liu, Qiang Zhu, Youchao Dong, C. Titus Brown, Sakti Pramanik:
A new method for DNA sequencing error verification and correction via an on-disk index tree. BCB 2015: 503-504 - [c46]A. K. M. Tauhidul Islam, Sakti Pramanik, Xinge Ji, James R. Cole, Qiang Zhu:
Back translated peptide K-mer search and local alignment in large DNA sequence databases using BoND-SD-tree indexing. BIBE 2015: 1-6 - 2014
- [j39]Dashiell Kolbe, Qiang Zhu, Sakti Pramanik:
k-Nearest neighbor searching in hybrid spaces. Inf. Syst. 43: 55-64 (2014) - [j38]Alok Watve, Sakti Pramanik, Sungwon Jung, Bumjoon Jo, Sunil Kumar, Shamik Sural:
Clustering Non-Ordered Discrete Data. J. Inf. Sci. Eng. 30(1): 1-23 (2014) - 2013
- [j37]Changqing Chen, Alok Watve, Sakti Pramanik, Qiang Zhu:
The BoND-Tree: An Efficient Indexing Method for Box Queries in Nonordered Discrete Data Spaces. IEEE Trans. Knowl. Data Eng. 25(11): 2629-2643 (2013) - 2012
- [c45]Salman Shahid, Sakti Pramanik, Charles B. Owen:
Minimum bounding boxes for regular cross-polytopes. SAC 2012: 879-884 - 2011
- [j36]Rahul Gupta, Soumya K. Ghosh, Shamik Sural, Sakti Pramanik:
Hybrid index-based image search from the web. Int. J. Data Min. Model. Manag. 3(3): 252-276 (2011) - 2010
- [j35]Dashiell Kolbe, Qiang Zhu, Sakti Pramanik:
Reducing non-determinism of k-NN searching in non-ordered discrete data spaces. Inf. Process. Lett. 110(10): 420-423 (2010) - [j34]Sakti Pramanik, Alok Watve, Chad R. Meiners, Alex X. Liu:
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access. Proc. VLDB Endow. 3(1): 409-416 (2010) - [j33]Dashiell Kolbe, Qiang Zhu, Sakti Pramanik:
Efficient k-nearest neighbor searching in nonordered discrete data spaces. ACM Trans. Inf. Syst. 28(2): 7:1-7:33 (2010) - [c44]Stuart King, Yanni Sun, James R. Cole, Sakti Pramanik:
BLAST Tree: Fast Filtering for Genomic Sequence Classification. BIBE 2010: 58-65
2000 – 2009
- 2009
- [j32]Sunil Kumar, Shamik Sural, Alok Watve, Sakti Pramanik:
CNODE: clustering of set-valued non-ordered discrete data. Int. J. Data Min. Model. Manag. 1(3): 310-334 (2009) - [c43]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: 462-471 - [c42]Changqing Chen, Sakti Pramanik, Qiang Zhu, Gang Qian:
A Study of Indexing Strategies for Hybrid Data Spaces. ICEIS 2009: 149-159 - [c41]Hyun-Jeong Seok, Qiang Zhu, Gang Qian, Sakti Pramanik, Wen-Chi Hou:
Deletion Techniques for the ND-tree in Non-ordered Discrete Data Spaces. SEDE 2009: 1-6 - 2008
- [c40]Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R. Oswald, Sakti Pramanik:
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces. DASFAA 2008: 156-171 - [c39]Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Pramanik:
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces. DEXA 2008: 404-418 - 2007
- [c38]Dashiell Kolbe, Qiang Zhu, Sakti Pramanik:
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces. ICDE 2007: 426-435 - 2006
- [j31]Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik:
Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach. ACM Trans. Database Syst. 31(2): 439-484 (2006) - [j30]Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik:
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces. ACM Trans. Inf. Syst. 24(1): 79-110 (2006) - [c37]Qiang Xue, James R. Cole, Sakti Pramanik:
Sequence Homology Search Based on Database Indexing Using the Profile Hidden Markov Model. BIBE 2006: 135-140 - 2005
- [j29]Qiang Xue, Sakti Pramanik, Gang Qian, Qiang Zhu:
A hybrid index structure for querying large string databases. Int. J. Electron. Bus. 3(3/4): 243-254 (2005) - [j28]Sungwon Jung, Byungkyu Lee, Sakti Pramanik:
A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments. IEEE Trans. Knowl. Data Eng. 17(3): 311-325 (2005) - [c36]Qiang Xue, Sakti Pramanik, Gang Qian, Qiang Zhu:
The Hybrid Digital Tree: A New Indexing Technique for Large String Databases. ICEIS (1) 2005: 115-121 - 2004
- [c35]Gang Qian, Shamik Sural, Yuelong Gu, Sakti Pramanik:
Similarity between Euclidean and cosine angle distance for nearest neighbor queries. SAC 2004: 1232-1237 - 2003
- [c34]Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik:
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces. VLDB 2003: 620-631 - 2002
- [j27]Sungwon Jung, Sakti Pramanik:
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps. IEEE Trans. Knowl. Data Eng. 14(5): 1029-1046 (2002) - [c33]Shamik Sural, Gang Qian, Sakti Pramanik:
A comparative analysis of two distance measures in color image databases. ICIP (1) 2002: 401-404 - [c32]Shamik Sural, Gang Qian, Sakti Pramanik:
Segmentation and histogram generation using the HSV color space for image retrieval. ICIP (2) 2002: 589-592 - [c31]Shamik Sural, Gang Qian, Sakti Pramanik:
A Histogramm with Perceptually Smooth Color Transition for Image Retrieval. JCIS 2002: 664-667 - 2001
- [c30]Sakti Pramanik, Jinhua Li:
Clustered SS-Tree. ICME 2001 - 2000
- [j26]Bonnie L. Maidak, James R. Cole, Timothy G. Lilburn, Charles T. Parker Jr., Paul Saxman, Jason M. Stredwick, George M. Garrity, Bing Li, Gary J. Olsen, Sakti Pramanik, Thomas M. Schmidt, James M. Tiedje:
The RDP (Ribosomal Database Project) continues. Nucleic Acids Res. 28(1): 173-174 (2000) - [c29]Sakti Pramanik, Jinhua Li, Jiandong Ruan:
Performance Analysis of AB-Tree. IEEE International Conference on Multimedia and Expo (III) 2000: 1701-1704 - [c28]Sankhayan Choudhury, Nabendu Chaki, Sakti Pramanik, Swapan Bhattacharya:
Conceptual Level Graph Theoretic Design and Development of Complex Information System. ITCC 2000: 449-454
1990 – 1999
- 1999
- [j25]Yang Zhong, Y. Luo, Sakti Pramanik, John H. Beaman:
HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees. Bioinform. 15(2): 149-156 (1999) - [j24]Bonnie L. Maidak, James R. Cole, Charles T. Parker Jr., George M. Garrity, Niels Larsen, Bing Li, Timothy G. Lilburn, Michael J. McCaughey, Gary J. Olsen, Ross A. Overbeek, Sakti Pramanik, Thomas M. Schmidt, James M. Tiedje, Carl R. Woese:
A new version of the RDP (Ribosomal Database Project). Nucleic Acids Res. 27(1): 171-173 (1999) - [c27]Sakti Pramanik, Jinhua Li:
Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions. ICDE 1999: 251 - [c26]Sakti Pramanik, Scott Alexander, Jinhua Li:
An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions. ICMCS, Vol. 1 1999: 865-869 - 1998
- [c25]Jaruloj Eamsiri Chongstitvatana, Sakti Pramanik:
Extending Relational Algebra to Incorporate Characteristics of Temporal Data. IADT 1998: 328-335 - 1997
- [j23]Sakti Pramanik, Walid R. Tout:
The NUMA with Clusters of Processors for Parallel Join. IEEE Trans. Knowl. Data Eng. 9(4): 653-660 (1997) - 1996
- [j22]Jin Kim, James R. Cole, Sakti Pramanik:
Alignment of possible secondary structures in multiple RNA sequences using simulated annealing. Comput. Appl. Biosci. 12(4): 259-267 (1996) - [j21]Sakti Pramanik, Sungwon Jung:
Description and Identification of Distributed Fragments of Recursive Relations. IEEE Trans. Knowl. Data Eng. 8(6): 1002-1016 (1996) - [c24]Sungwon Jung, Sakti Pramanik:
HiTi Graph Model of Topographical Roadmaps in Navigation Systems. ICDE 1996: 76-84 - [c23]Jin Kim, James R. Cole, Eric Torng, Sakti Pramanik:
Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing. ISMB 1996: 125-133 - 1995
- [j20]Sungwon Jung, Steve Perkins, Yang Zhong, Sakti Pramanik, John H. Beaman:
A new data model for biological classification. Comput. Appl. Biosci. 11(3): 237-246 (1995) - [j19]Anastasia Analyti, Sakti Pramanik:
Reliable Semantics for Extended Logic Programs with Rule Prioritization. J. Log. Comput. 5(3): 303-324 (1995) - [j18]Walid R. Tout, Sakti Pramanik:
Distributed Load Balancing for Parallel Main Memory Hash Join. IEEE Trans. Parallel Distributed Syst. 6(8): 841-849 (1995) - [c22]Sungwon Jung, Sakti Pramanik:
An Efficient Representation of Distributed Fragments of Recursive Relations. DASFAA 1995: 397-404 - 1994
- [j17]Jin Kim, Sakti Pramanik, Moon-Jung Chung:
Multiple sequence alignment using simulated annealing. Comput. Appl. Biosci. 10(4): 419-426 (1994) - [c21]Anastasia Analyti, Sakti Pramanik:
Semantics for Reasoning with Contradictory Extended Logic Programs. GULP-PRODE (1) 1994: 434-448 - [c20]Jin Kim, Sakti Pramanik:
An Efficient Method for Multiple Sequence Alignment. ISMB 1994: 212-218 - [c19]Anastasia Analyti, Sakti Pramanik:
Declarative Semantics for Contradictory Modular Logic Programs. ISMIS 1994: 245-254 - 1993
- [j16]Anastasia Analyti, Sakti Pramanik:
Performance Analysis of a Main Memory Multi-Directory Hashing Technique. Inf. Process. Lett. 45(4): 191-197 (1993) - [j15]Sakti Pramanik, Anastasia Analyti, Henry Davies, Hsiao-Yu Chou:
Multi-Directory Hashing. Inf. Syst. 18(1): 63-74 (1993) - [c18]Robert L. Grossman, Yannis E. Ioannidis, Edward N. May, Sakti Pramanik, Ruth Pordes:
Panel: Scientific Databases. FODO 1993: 361 - [c17]Walid R. Tout, Sakti Pramanik:
A Distributed Load Balancing Scheme for Data Parallel Applications. ICPP (2) 1993: 213-216 - 1992
- [j14]Myoung-Ho Kim, Sakti Pramanik:
Optimizing Database Accesses for Parallel Processing of Multikey Range Searches. Comput. J. 35(1): 45-51 (1992) - [j13]Sakti Pramanik, Farshad Fotouhi:
Join and Semi-join Algorithms Based on Partial-relation Schemes. Comput. J. 35(Additional-Papers): A131-A140 (1992) - [c16]Sakti Pramanik, David T. Kao, David Vineyard:
Fragmentation of Recursive Relations in Distributed Datbases. EDBT 1992: 389-404 - [c15]Anastasia Analyti, Sakti Pramanik:
Fast Search in Main Memory Databases. SIGMOD Conference 1992: 215-224 - 1991
- [j12]Myoung-Ho Kim, Sakti Pramanik:
The FX Distribution Method for Parallel Processing of Partial Match Queries. Inf. Process. Lett. 38(5): 243-252 (1991) - [j11]Farshad Fotouhi, Sakti Pramanik:
Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard. Inf. Process. Lett. 38(5): 271-275 (1991) - 1990
- [j10]Sakti Pramanik, Myoung-Ho Kim:
Parallel Processing of Large Node B-Trees. IEEE Trans. Computers 39(9): 1208-1212 (1990) - [c14]Charles R. Severance, Sakti Pramanik:
Distributed Linear Hashing for Main Memory Databases. ICPP (1) 1990: 92-95 - [c13]Sakti Pramanik, Charles R. Severance, Todd Rosenau:
A High Speed Main Memory File System for Shared Memory Multi-Processor Systems. PARBASE / Databases 1990: 187-203 - [c12]Charles R. Severance, Sakti Pramanik, P. Wolberg:
Distributed Linear Hashing and Parallel Projection in Main Memory Databases. VLDB 1990: 674-682
1980 – 1989
- 1989
- [j9]Farshad Fotouhi, Sakti Pramanik:
Optimal Secondary Storage Access Sequence for Performing Relational Join. IEEE Trans. Knowl. Data Eng. 1(3): 318-328 (1989) - [c11]Myoung-Ho Kim, Sakti Pramanik:
On the Data Distribution Problems for Range Queries. ICPP (1) 1989: 91-94 - [c10]Sakti Pramanik, Myoung-Ho Kim:
Database Processing Models in Parallel Processing Systems. IWDM 1989: 112-126 - 1988
- [j8]Sakti Pramanik, Myoung-Ho Kim:
HCB-Tree: A Height Compressed B-Tree for Parallel Processing. Inf. Process. Lett. 29(4): 213-220 (1988) - [j7]Sakti Pramanik, Farshad Fotouhi:
Optimizing the cost of relational queries using Partial-Relation schemes. Inf. Syst. 13(1): 71-79 (1988) - [j6]Sakti Pramanik, David Vineyard:
Optimizing Join Queries in Distributed Databases. IEEE Trans. Software Eng. 14(9): 1319-1326 (1988) - [c9]Myoung-Ho Kim, Sakti Pramanik:
Optimal File Distribution For Partial Match Retrieval. SIGMOD Conference 1988: 173-182 - 1987
- [c8]Sakti Pramanik, David Vineyard:
Optimizing Join Queries in Distributed Database. FSTTCS 1987: 282-304 - [c7]Sakti Pramanik, Myoung-Ho Kim:
HCB-Tree: A B-Tree Structure for Parallel Processing. ICPP 1987: 140-146 - 1986
- [j5]Sakti Pramanik, Farshad Fotouhi:
Index Database Machine. Comput. J. 29(5): 451-457 (1986) - [j4]Sakti Pramanik:
Performance Analysis of a Database Filter Search Hardware. IEEE Trans. Computers 35(12): 1077-1082 (1986) - 1985
- [j3]Sakti Pramanik, Chung-Ta King:
A Hardware Pattern Matching Algorithm on a Dataflow. Comput. J. 28(3): 264-269 (1985) - [j2]Sakti Pramanik, David Ittner:
Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join. ACM Trans. Database Syst. 10(1): 57-74 (1985) - 1984
- [j1]Sakti Pramanik, Bernhard Weinberg:
The implementation kit with monitors. ACM SIGPLAN Notices 19(9): 30-33 (1984) - 1983
- [c6]Sakti Pramanik:
Implementing set-theoretic relational-query functions using highly parallel index-processing hardware. AFIPS National Computer Conference 1983: 283-291 - 1982
- [c5]Sakti Pramanik:
Database filters. ISCA 1982: 201-210 - 1981
- [c4]Sakti Pramanik:
Highly parallel associative search and its application to cellular database machine design. AFIPS National Computer Conference 1981: 521-528 - [c3]Sakti Pramanik:
Hardware Organization for Nonnumeric Processing. VLDB 1981: 66-75 - 1980
- [c2]Sakti Pramanik:
A mathematical model of character string manipulation. AFIPS National Computer Conference 1980: 837-839
1970 – 1979
- 1979
- [c1]Sakti Pramanik, Edgar T. Irons:
A data-handling mechanics of on-line text editing system with efficient secondary storage access. MARK 1979: 273-278
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
