Sakti Pramanik

Publication Activity (10 Years)

Years Active: 1979-2024
Publications (10 Years): 9

Top Topics

Top Venues

IEEE Trans. Knowl. Data Eng.

J. Inf. Sci. Eng.

IEICE Trans. Inf. Syst.

Publications

A. K. M. Tauhidul Islam, Sakti Pramanik
Fast Edit Distance Prediction for All Pairs of Sequences in Very Large NGS Datasets. PKDD (4) (2024)
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) (2020)
Ramblin Cherniak, Qiang Zhu, Sakti Pramanik
A Study of Update Methods for BoND-Tree Index on Non-ordered Discrete Vector Data. CATA (2020)
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) (2020)
Alok Watve, Sakti Pramanik, Sungwon Jung, Chae Yong Lim
Data-independent vantage point selection for range queries. J. Supercomput. 75 (12) (2019)
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. (4) (2019)
Sakti Pramanik, A. K. M. Tauhidul Islam, Shamik Sural
Predicted Edit Distance Based Clustering of Gene Sequences. ICDM (2018)
A. K. M. Tauhidul Islam, Sakti Pramanik, Vahid Mirjalili, Shamik Sural
RESTRAC: REference Sequence Based Space TRAnsformation for Clustering. ICDM Workshops (2017)
Ramblin Cherniak, Qiang Zhu, Yarong Gu, Sakti Pramanik
Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data Spaces. IDEAS (2017)
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)
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)
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) (2015)
Alok Watve, Sakti Pramanik, Sungwon Jung, Bumjoon Jo, Sunil Kumar, Shamik Sural
Clustering Non-Ordered Discrete Data. J. Inf. Sci. Eng. 30 (1) (2014)
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
k-Nearest neighbor searching in hybrid spaces. Inf. Syst. 43 (2014)
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) (2013)
Salman Shahid, Sakti Pramanik, Charles B. Owen
Minimum bounding boxes for regular cross-polytopes. SAC (2012)
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) (2011)
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) (2010)
Stuart King, Yanni Sun, James R. Cole, Sakti Pramanik
BLAST Tree: Fast Filtering for Genomic Sequence Classification. BIBE (2010)
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
Efficient k-nearest neighbor searching in nonordered discrete data spaces. ACM Trans. Inf. Syst. 28 (2) (2010)
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
Reducing non-determinism of k-NN searching in non-ordered discrete data spaces. Inf. Process. Lett. 110 (10) (2010)
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) (2009)
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)
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)
Changqing Chen, Sakti Pramanik, Qiang Zhu, Gang Qian
A Study of Indexing Strategies for Hybrid Data Spaces. ICEIS (2009)
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)
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)
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces. ICDE (2007)
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) (2006)
Qiang Xue, James R. Cole, Sakti Pramanik
Sequence Homology Search Based on Database Indexing Using the Profile Hidden Markov Model. BIBE (2006)
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) (2006)
Qiang Xue, Sakti Pramanik, Gang Qian, Qiang Zhu
The Hybrid Digital Tree: A New Indexing Technique for Large String Databases. ICEIS (1) (2005)
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) (2005)
Qiang Xue, Sakti Pramanik, Gang Qian, Qiang Zhu
A hybrid index structure for querying large string databases. Int. J. Electron. Bus. 3 (3/4) (2005)
Gang Qian, Shamik Sural, Yuelong Gu, Sakti Pramanik
Similarity between Euclidean and cosine angle distance for nearest neighbor queries. SAC (2004)
Gang Qian, Qiang Zhu, Qiang Xue, Sakti Pramanik
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces. VLDB (2003)
Shamik Sural, Gang Qian, Sakti Pramanik
Segmentation and histogram generation using the HSV color space for image retrieval. ICIP (2) (2002)
Sungwon Jung, Sakti Pramanik
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps. IEEE Trans. Knowl. Data Eng. 14 (5) (2002)
Shamik Sural, Gang Qian, Sakti Pramanik
A comparative analysis of two distance measures in color image databases. ICIP (1) (2002)
Shamik Sural, Gang Qian, Sakti Pramanik
A Histogramm with Perceptually Smooth Color Transition for Image Retrieval. JCIS (2002)
Sakti Pramanik, Jinhua Li
Clustered SS-Tree. ICME (2001)
Sankhayan Choudhury, Nabendu Chaki, Sakti Pramanik, Swapan Bhattacharya
Conceptual Level Graph Theoretic Design and Development of Complex Information System. ITCC (2000)
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) (2000)
Sakti Pramanik, Jinhua Li, Jiandong Ruan
Performance Analysis of AB-Tree. IEEE International Conference on Multimedia and Expo (III) (2000)
Sakti Pramanik, Jinhua Li
Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions. ICDE (1999)
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) (1999)
Sakti Pramanik, Scott Alexander, Jinhua Li
An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions. ICMCS, Vol. 1 (1999)
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) (1999)
Jaruloj Eamsiri Chongstitvatana, Sakti Pramanik
Extending Relational Algebra to Incorporate Characteristics of Temporal Data. IADT (1998)
Sakti Pramanik, Walid R. Tout
The NUMA with Clusters of Processors for Parallel Join. IEEE Trans. Knowl. Data Eng. 9 (4) (1997)
Sungwon Jung, Sakti Pramanik
HiTi Graph Model of Topographical Roadmaps in Navigation Systems. ICDE (1996)
Sakti Pramanik, Sungwon Jung
Description and Identification of Distributed Fragments of Recursive Relations. IEEE Trans. Knowl. Data Eng. 8 (6) (1996)
Jin Kim, James R. Cole, Sakti Pramanik
Alignment of possible secondary structures in multiple RNA sequences using simulated annealing. Comput. Appl. Biosci. 12 (4) (1996)
Jin Kim, James R. Cole, Eric Torng, Sakti Pramanik
Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing. ISMB (1996)
Walid R. Tout, Sakti Pramanik
Distributed Load Balancing for Parallel Main Memory Hash Join. IEEE Trans. Parallel Distributed Syst. 6 (8) (1995)
Sungwon Jung, Sakti Pramanik
An Efficient Representation of Distributed Fragments of Recursive Relations. DASFAA (1995)
Anastasia Analyti, Sakti Pramanik
Reliable Semantics for Extended Logic Programs with Rule Prioritization. J. Log. Comput. 5 (3) (1995)
Sungwon Jung, Steve Perkins, Yang Zhong, Sakti Pramanik, John H. Beaman
A new data model for biological classification. Comput. Appl. Biosci. 11 (3) (1995)
Anastasia Analyti, Sakti Pramanik
Semantics for Reasoning with Contradictory Extended Logic Programs. GULP-PRODE (1) (1994)
Jin Kim, Sakti Pramanik
An Efficient Method for Multiple Sequence Alignment. ISMB (1994)
Anastasia Analyti, Sakti Pramanik
Declarative Semantics for Contradictory Modular Logic Programs. ISMIS (1994)
Jin Kim, Sakti Pramanik, Moon-Jung Chung
Multiple sequence alignment using simulated annealing. Comput. Appl. Biosci. 10 (4) (1994)
Sakti Pramanik, Anastasia Analyti, Henry Davies, Hsiao-Yu Chou
Multi-Directory Hashing. Inf. Syst. 18 (1) (1993)
Walid R. Tout, Sakti Pramanik
A Distributed Load Balancing Scheme for Data Parallel Applications. ICPP (2) (1993)
Anastasia Analyti, Sakti Pramanik
Performance Analysis of a Main Memory Multi-Directory Hashing Technique. Inf. Process. Lett. 45 (4) (1993)
Robert L. Grossman, Yannis E. Ioannidis, Edward N. May, Sakti Pramanik, Ruth Pordes
Panel: Scientific Databases. FODO (1993)
Anastasia Analyti, Sakti Pramanik
Fast Search in Main Memory Databases. SIGMOD Conference (1992)
Sakti Pramanik, Farshad Fotouhi
Join and Semi-join Algorithms Based on Partial-relation Schemes. Comput. J. 35 (Additional-Papers) (1992)
Sakti Pramanik, David T. Kao, David Vineyard
Fragmentation of Recursive Relations in Distributed Datbases. EDBT (1992)
Myoung-Ho Kim, Sakti Pramanik
Optimizing Database Accesses for Parallel Processing of Multikey Range Searches. Comput. J. 35 (1) (1992)
Farshad Fotouhi, Sakti Pramanik
Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard. Inf. Process. Lett. 38 (5) (1991)
Myoung-Ho Kim, Sakti Pramanik
The FX Distribution Method for Parallel Processing of Partial Match Queries. Inf. Process. Lett. 38 (5) (1991)
Charles R. Severance, Sakti Pramanik
Distributed Linear Hashing for Main Memory Databases. ICPP (1) (1990)
Sakti Pramanik, Myoung-Ho Kim
Parallel Processing of Large Node B-Trees. IEEE Trans. Computers 39 (9) (1990)
Charles R. Severance, Sakti Pramanik, P. Wolberg
Distributed Linear Hashing and Parallel Projection in Main Memory Databases. VLDB (1990)
Sakti Pramanik, Charles R. Severance, Todd Rosenau
A High Speed Main Memory File System for Shared Memory Multi-Processor Systems. PARBASE / Databases (1990)
Sakti Pramanik, Myoung-Ho Kim
Database Processing Models in Parallel Processing Systems. IWDM (1989)
Myoung-Ho Kim, Sakti Pramanik
On the Data Distribution Problems for Range Queries. ICPP (1) (1989)
Farshad Fotouhi, Sakti Pramanik
Optimal Secondary Storage Access Sequence for Performing Relational Join. IEEE Trans. Knowl. Data Eng. 1 (3) (1989)
Sakti Pramanik, David Vineyard
Optimizing Join Queries in Distributed Databases. IEEE Trans. Software Eng. 14 (9) (1988)
Sakti Pramanik, Farshad Fotouhi
Optimizing the cost of relational queries using Partial-Relation schemes. Inf. Syst. 13 (1) (1988)
Sakti Pramanik, Myoung-Ho Kim
HCB-Tree: A Height Compressed B-Tree for Parallel Processing. Inf. Process. Lett. 29 (4) (1988)
Myoung-Ho Kim, Sakti Pramanik
Optimal File Distribution For Partial Match Retrieval. SIGMOD Conference (1988)
Sakti Pramanik, David Vineyard
Optimizing Join Queries in Distributed Database. FSTTCS (1987)
Sakti Pramanik, Myoung-Ho Kim
HCB-Tree: A B-Tree Structure for Parallel Processing. ICPP (1987)
Sakti Pramanik, Farshad Fotouhi
Index Database Machine. Comput. J. 29 (5) (1986)
Sakti Pramanik
Performance Analysis of a Database Filter Search Hardware. IEEE Trans. Computers 35 (12) (1986)
Sakti Pramanik, David Ittner
Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join. ACM Trans. Database Syst. 10 (1) (1985)
Sakti Pramanik, Chung-Ta King
A Hardware Pattern Matching Algorithm on a Dataflow. Comput. J. 28 (3) (1985)
Sakti Pramanik, Bernhard Weinberg
The implementation kit with monitors. ACM SIGPLAN Notices 19 (9) (1984)
Sakti Pramanik
Implementing set-theoretic relational-query functions using highly parallel index-processing hardware. AFIPS National Computer Conference (1983)
Sakti Pramanik
Database filters. ISCA (1982)
Sakti Pramanik
Hardware Organization for Nonnumeric Processing VLDB (1981)
Sakti Pramanik
Highly parallel associative search and its application to cellular database machine design. AFIPS National Computer Conference (1981)
Sakti Pramanik
A mathematical model of character string manipulation. AFIPS National Computer Conference (1980)
Sakti Pramanik, Edgar T. Irons
A data-handling mechanics of on-line text editing system with efficient secondary storage access. MARK (1979)