A data-handling mechanics of on-line text editing system with efficient secondary storage access. - Sakti Pramanik; Edgar T. Irons (MARK, 1979)

A mathematical model of character string manipulation. - Sakti Pramanik (AFIPS National Computer Conference, 1980)

Highly parallel associative search and its application to cellular database machine design. - Sakti Pramanik (AFIPS National Computer Conference, 1981)

Hardware Organization for Nonnumeric Processing - Sakti Pramanik (VLDB, 1981)

Database filters. - Sakti Pramanik (ISCA, 1982)

Implementing set-theoretic relational-query functions using highly parallel index-processing hardware. - Sakti Pramanik (AFIPS National Computer Conference, 1983)

The implementation kit with monitors. - Sakti Pramanik; Bernhard Weinberg (ACM SIGPLAN Notices, 1984)

A Hardware Pattern Matching Algorithm on a Dataflow. - Sakti Pramanik; Chung-Ta King (Comput. J., 1985)

Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join. - Sakti Pramanik; David Ittner (ACM Trans. Database Syst., 1985)

Index Database Machine. - Sakti Pramanik; Farshad Fotouhi (Comput. J., 1986)

Performance Analysis of a Database Filter Search Hardware. - Sakti Pramanik (IEEE Trans. Computers, 1986)

Optimizing Join Queries in Distributed Database. - Sakti Pramanik; David Vineyard (FSTTCS, 1987)

HCB-Tree: A B-Tree Structure for Parallel Processing. - Sakti Pramanik; Myoung-Ho Kim (ICPP, 1987)

Optimal File Distribution For Partial Match Retrieval. - Myoung-Ho Kim; Sakti Pramanik (SIGMOD Conference, 1988)

HCB-Tree: A Height Compressed B-Tree for Parallel Processing. - Sakti Pramanik; Myoung-Ho Kim (Inf. Process. Lett., 1988)

Optimizing the cost of relational queries using Partial-Relation schemes. - Sakti Pramanik; Farshad Fotouhi (Inf. Syst., 1988)

Optimizing Join Queries in Distributed Databases. - Sakti Pramanik; David Vineyard (IEEE Trans. Software Eng., 1988)

On the Data Distribution Problems for Range Queries. - Myoung-Ho Kim; Sakti Pramanik (ICPP (1), 1989)

Database Processing Models in Parallel Processing Systems. - Sakti Pramanik; Myoung-Ho Kim (IWDM, 1989)

Optimal Secondary Storage Access Sequence for Performing Relational Join. - Farshad Fotouhi; Sakti Pramanik (IEEE Trans. Knowl. Data Eng., 1989)

Distributed Linear Hashing for Main Memory Databases. - Charles R. Severance; Sakti Pramanik (ICPP (1), 1990)

A High Speed Main Memory File System for Shared Memory Multi-Processor Systems. - Sakti Pramanik; Charles R. Severance; Todd Rosenau (PARBASE / Databases, 1990)

Distributed Linear Hashing and Parallel Projection in Main Memory Databases. - Charles R. Severance; Sakti Pramanik; P. Wolberg (VLDB, 1990)

Parallel Processing of Large Node B-Trees. - Sakti Pramanik; Myoung-Ho Kim (IEEE Trans. Computers, 1990)

Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard. - Farshad Fotouhi; Sakti Pramanik (Inf. Process. Lett., 1991)

The FX Distribution Method for Parallel Processing of Partial Match Queries. - Myoung-Ho Kim; Sakti Pramanik (Inf. Process. Lett., 1991)

Fragmentation of Recursive Relations in Distributed Datbases. - Sakti Pramanik; David T. Kao; David Vineyard (EDBT, 1992)

Fast Search in Main Memory Databases. - Anastasia Analyti; Sakti Pramanik (SIGMOD Conference, 1992)

Optimizing Database Accesses for Parallel Processing of Multikey Range Searches. - Myoung-Ho Kim; Sakti Pramanik (Comput. J., 1992)

Join and Semi-join Algorithms Based on Partial-relation Schemes. - Sakti Pramanik; Farshad Fotouhi (Comput. J., 1992)

Panel: Scientific Databases. - Robert L. Grossman; Yannis E. Ioannidis; Edward N. May; Sakti Pramanik; Ruth Pordes (FODO, 1993)

A Distributed Load Balancing Scheme for Data Parallel Applications. - Walid R. Tout; Sakti Pramanik (ICPP (2), 1993)

Performance Analysis of a Main Memory Multi-Directory Hashing Technique. - Anastasia Analyti; Sakti Pramanik (Inf. Process. Lett., 1993)

Multi-Directory Hashing. - Sakti Pramanik; Anastasia Analyti; Henry Davies; Hsiao-Yu Chou (Inf. Syst., 1993)

Semantics for Reasoning with Contradictory Extended Logic Programs. - Anastasia Analyti; Sakti Pramanik (GULP-PRODE (1), 1994)

An Efficient Method for Multiple Sequence Alignment. - Jin Kim 002; Sakti Pramanik (ISMB, 1994)

Declarative Semantics for Contradictory Modular Logic Programs. - Anastasia Analyti; Sakti Pramanik (ISMIS, 1994)

Multiple sequence alignment using simulated annealing. - Jin Kim 002; Sakti Pramanik; Moon-Jung Chung (Comput. Appl. Biosci., 1994)

An Efficient Representation of Distributed Fragments of Recursive Relations. - Sungwon Jung; Sakti Pramanik (DASFAA, 1995)

A new data model for biological classification. - Sungwon Jung; Steve Perkins; Yang Zhong; Sakti Pramanik; John H. Beaman (Comput. Appl. Biosci., 1995)

Reliable Semantics for Extended Logic Programs with Rule Prioritization. - Anastasia Analyti; Sakti Pramanik (J. Log. Comput., 1995)

Distributed Load Balancing for Parallel Main Memory Hash Join. - Walid R. Tout; Sakti Pramanik (IEEE Trans. Parallel Distributed Syst., 1995)

HiTi Graph Model of Topographical Roadmaps in Navigation Systems. - Sungwon Jung; Sakti Pramanik (ICDE, 1996)

Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing. - Jin Kim 002; James R. Cole; Eric Torng; Sakti Pramanik (ISMB, 1996)

Alignment of possible secondary structures in multiple RNA sequences using simulated annealing. - Jin Kim 002; James R. Cole; Sakti Pramanik (Comput. Appl. Biosci., 1996)

Description and Identification of Distributed Fragments of Recursive Relations. - Sakti Pramanik; Sungwon Jung (IEEE Trans. Knowl. Data Eng., 1996)

The NUMA with Clusters of Processors for Parallel Join. - Sakti Pramanik; Walid R. Tout (IEEE Trans. Knowl. Data Eng., 1997)

Extending Relational Algebra to Incorporate Characteristics of Temporal Data. - Jaruloj Eamsiri Chongstitvatana; Sakti Pramanik (IADT, 1998)

Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions. - Sakti Pramanik; Jinhua Li (ICDE, 1999)

An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions. - Sakti Pramanik; Scott Alexander; Jinhua Li (ICMCS, Vol. 1, 1999)

HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees. - Yang Zhong; Y. Luo; Sakti Pramanik; John H. Beaman (Bioinform., 1999)

A new version of the RDP (Ribosomal Database Project). - 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; et al. (Nucleic Acids Res., 1999)

Performance Analysis of AB-Tree. - Sakti Pramanik; Jinhua Li; Jiandong Ruan (IEEE International Conference on Multimedia and Expo (III), 2000)

Conceptual Level Graph Theoretic Design and Development of Complex Information System. - Sankhayan Choudhury; Nabendu Chaki; Sakti Pramanik; Swapan Bhattacharya (ITCC, 2000)

The RDP (Ribosomal Database Project) continues. - 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 (Nucleic Acids Res., 2000)

Clustered SS-Tree. - Sakti Pramanik; Jinhua Li (ICME, 2001)

A comparative analysis of two distance measures in color image databases. - Shamik Sural; Gang Qian; Sakti Pramanik (ICIP (1), 2002)

Segmentation and histogram generation using the HSV color space for image retrieval. - Shamik Sural; Gang Qian; Sakti Pramanik (ICIP (2), 2002)

A Histogramm with Perceptually Smooth Color Transition for Image Retrieval. - Shamik Sural; Gang Qian; Sakti Pramanik (JCIS, 2002)

An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps. - Sungwon Jung; Sakti Pramanik (IEEE Trans. Knowl. Data Eng., 2002)

The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces. - Gang Qian; Qiang Zhu 001; Qiang Xue; Sakti Pramanik (VLDB, 2003)

Similarity between Euclidean and cosine angle distance for nearest neighbor queries. - Gang Qian; Shamik Sural; Yuelong Gu; Sakti Pramanik (SAC, 2004)

The Hybrid Digital Tree: A New Indexing Technique for Large String Databases. - Qiang Xue; Sakti Pramanik; Gang Qian; Qiang Zhu 001 (ICEIS (1), 2005)

A hybrid index structure for querying large string databases. - Qiang Xue; Sakti Pramanik; Gang Qian; Qiang Zhu 001 (Int. J. Electron. Bus., 2005)

A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments. - Sungwon Jung; Byungkyu Lee; Sakti Pramanik (IEEE Trans. Knowl. Data Eng., 2005)

Sequence Homology Search Based on Database Indexing Using the Profile Hidden Markov Model. - Qiang Xue; James R. Cole; Sakti Pramanik (BIBE, 2006)

Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach. - Gang Qian; Qiang Zhu 001; Qiang Xue; Sakti Pramanik (ACM Trans. Database Syst., 2006)

A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces. - Gang Qian; Qiang Zhu 001; Qiang Xue; Sakti Pramanik (ACM Trans. Inf. Syst., 2006)

On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces. - Dashiell Kolbe; Qiang Zhu 001; Sakti Pramanik (ICDE, 2007)

Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces. - Hyun-Jeong Seok; Gang Qian; Qiang Zhu 001; Alexander R. Oswald; Sakti Pramanik (DASFAA, 2008)

Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces. - Gang Qian; Hyun-Jeong Seok; Qiang Zhu 001; Sakti Pramanik (DEXA, 2008)

The C-ND tree: a multidimensional index for hybrid continuous and non-ordered discrete data spaces. - Changqing Chen; Sakti Pramanik; Qiang Zhu 001; Alok Watve; Gang Qian (EDBT, 2009)

A Study of Indexing Strategies for Hybrid Data Spaces. - Changqing Chen; Sakti Pramanik; Qiang Zhu 001; Gang Qian (ICEIS, 2009)

Deletion Techniques for the ND-tree in Non-ordered Discrete Data Spaces. - Hyun-Jeong Seok; Qiang Zhu 001; Gang Qian; Sakti Pramanik; Wen-Chi Hou (SEDE, 2009)

CNODE: clustering of set-valued non-ordered discrete data. - Sunil Kumar; Shamik Sural; Alok Watve; Sakti Pramanik (Int. J. Data Min. Model. Manag., 2009)

BLAST Tree: Fast Filtering for Genomic Sequence Classification. - Stuart King; Yanni Sun; James R. Cole; Sakti Pramanik (BIBE, 2010)

Reducing non-determinism of k-NN searching in non-ordered discrete data spaces. - Dashiell Kolbe; Qiang Zhu 001; Sakti Pramanik (Inf. Process. Lett., 2010)

Transforming Range Queries To Equivalent Box Queries To Optimize Page Access. - Sakti Pramanik; Alok Watve; Chad R. Meiners; Alex X. Liu (Proc. VLDB Endow., 2010)

Efficient k-nearest neighbor searching in nonordered discrete data spaces. - Dashiell Kolbe; Qiang Zhu 001; Sakti Pramanik (ACM Trans. Inf. Syst., 2010)

Hybrid index-based image search from the web. - Rahul Gupta; Soumya K. Ghosh 001; Shamik Sural; Sakti Pramanik (Int. J. Data Min. Model. Manag., 2011)

Minimum bounding boxes for regular cross-polytopes. - Salman Shahid; Sakti Pramanik; Charles B. Owen (SAC, 2012)

The BoND-Tree: An Efficient Indexing Method for Box Queries in Nonordered Discrete Data Spaces. - Changqing Chen; Alok Watve; Sakti Pramanik; Qiang Zhu 001 (IEEE Trans. Knowl. Data Eng., 2013)

k-Nearest neighbor searching in hybrid spaces. - Dashiell Kolbe; Qiang Zhu 001; Sakti Pramanik (Inf. Syst., 2014)

Clustering Non-Ordered Discrete Data. - Alok Watve; Sakti Pramanik; Sungwon Jung; Bumjoon Jo; Sunil Kumar; Shamik Sural (J. Inf. Sci. Eng., 2014)

A new method for DNA sequencing error verification and correction via an on-disk index tree. - Yarong Gu; Xianying Liu; Qiang Zhu 001; Youchao Dong; C. Titus Brown; Sakti Pramanik (BCB, 2015)

Back translated peptide K-mer search and local alignment in large DNA sequence databases using BoND-SD-tree indexing. - A. K. M. Tauhidul Islam; Sakti Pramanik; Xinge Ji; James R. Cole; Qiang Zhu 001 (BIBE, 2015)

Topological Transformation Approaches to Database Query Processing. - Alok Watve; Sakti Pramanik; Salman Shahid; Chad R. Meiners; Alex X. Liu (IEEE Trans. Knowl. Data Eng., 2015)

RESTRAC: REference Sequence Based Space TRAnsformation for Clustering. - A. K. M. Tauhidul Islam; Sakti Pramanik; Vahid Mirjalili; Shamik Sural (ICDM Workshops, 2017)

Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data Spaces. - Ramblin Cherniak; Qiang Zhu 001; Yarong Gu; Sakti Pramanik (IDEAS, 2017)

Predicted Edit Distance Based Clustering of Gene Sequences. - Sakti Pramanik; A. K. M. Tauhidul Islam; Shamik Sural (ICDM, 2018)

The BINDS-Tree: A Space-Partitioning Based Indexing Scheme for Box Queries in Non-Ordered Discrete Data Spaces. - A. K. M. Tauhidul Islam; Sakti Pramanik; Qiang Zhu 001 (IEICE Trans. Inf. Syst., 2019)

Data-independent vantage point selection for range queries. - Alok Watve; Sakti Pramanik; Sungwon Jung; Chae Yong Lim (J. Supercomput., 2019)

A Study of Update Methods for BoND-Tree Index on Non-ordered Discrete Vector Data. - Ramblin Cherniak; Qiang Zhu 001; Sakti Pramanik (CATA, 2020)

VA-Store: A Virtual Approximate Store Approach to Supporting Repetitive Big Data in Genome Sequence Analyses. - Xianying Liu; Qiang Zhu 001; Sakti Pramanik; C. Titus Brown; Gang Qian (IEEE Trans. Knowl. Data Eng., 2020)

An Effective Clustering Method over CF$^+$+ Tree Using Multiple Range Queries. - Hyeong-Cheol Ryu; Sungwon Jung; Sakti Pramanik (IEEE Trans. Knowl. Data Eng., 2020)

Fast Edit Distance Prediction for All Pairs of Sequences in Very Large NGS Datasets. - A. K. M. Tauhidul Islam; Sakti Pramanik (PKDD (4), 2024)