Sakti Pramanik

Affiliations:
  • Michigan State University, East Lansing, USA


According to our database1, Sakti Pramanik authored at least 96 papers between 1979 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast Edit Distance Prediction for All Pairs of Sequences in Very Large NGS Datasets.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

2020
An Effective Clustering Method over CF$^+$+ Tree Using Multiple Range Queries.
IEEE Trans. Knowl. Data Eng., 2020

VA-Store: A Virtual Approximate Store Approach to Supporting Repetitive Big Data in Genome Sequence Analyses.
IEEE Trans. Knowl. Data Eng., 2020

A Study of Update Methods for BoND-Tree Index on Non-ordered Discrete Vector Data.
Proceedings of 35th International Conference on Computers and Their Applications, 2020

2019
Data-independent vantage point selection for range queries.
J. Supercomput., 2019

The BINDS-Tree: A Space-Partitioning Based Indexing Scheme for Box Queries in Non-Ordered Discrete Data Spaces.
IEICE Trans. Inf. Syst., 2019

2018
Predicted Edit Distance Based Clustering of Gene Sequences.
Proceedings of the IEEE International Conference on Data Mining, 2018

2017
Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data Spaces.
Proceedings of the 21st International Database Engineering & Applications Symposium, 2017

RESTRAC: REference Sequence Based Space TRAnsformation for Clustering.
Proceedings of the 2017 IEEE International Conference on Data Mining Workshops, 2017

2015
Topological Transformation Approaches to Database Query Processing.
IEEE Trans. Knowl. Data Eng., 2015

Back translated peptide K-mer search and local alignment in large DNA sequence databases using BoND-SD-tree indexing.
Proceedings of the 15th IEEE International Conference on Bioinformatics and Bioengineering, 2015

A new method for DNA sequencing error verification and correction via an on-disk index tree.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
Clustering Non-Ordered Discrete Data.
J. Inf. Sci. Eng., 2014

k-Nearest neighbor searching in hybrid spaces.
Inf. Syst., 2014

2013
The BoND-Tree: An Efficient Indexing Method for Box Queries in Nonordered Discrete Data Spaces.
IEEE Trans. Knowl. Data Eng., 2013

2012
Minimum bounding boxes for regular cross-polytopes.
Proceedings of the ACM Symposium on Applied Computing, 2012

2011
Hybrid index-based image search from the web.
Int. J. Data Min. Model. Manag., 2011

2010
Efficient k-nearest neighbor searching in nonordered discrete data spaces.
ACM Trans. Inf. Syst., 2010

Transforming Range Queries To Equivalent Box Queries To Optimize Page Access.
Proc. VLDB Endow., 2010

Reducing non-determinism of k-NN searching in non-ordered discrete data spaces.
Inf. Process. Lett., 2010

BLAST Tree: Fast Filtering for Genomic Sequence Classification.
Proceedings of the 10th IEEE International Conference on Bioinformatics and Bioengineering, 2010

2009
CNODE: clustering of set-valued non-ordered discrete data.
Int. J. Data Min. Model. Manag., 2009

Deletion Techniques for the ND-tree in Non-ordered Discrete Data Spaces.
Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

A Study of Indexing Strategies for Hybrid Data Spaces.
Proceedings of the Enterprise Information Systems, 11th International Conference, 2009

The C-ND tree: a multidimensional index for hybrid continuous and non-ordered discrete data spaces.
Proceedings of the EDBT 2009, 2009

2008
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces.
Proceedings of the Database and Expert Systems Applications, 19th International Conference, 2008

Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces.
Proceedings of the Database Systems for Advanced Applications, 2008

2007
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces.
ACM Trans. Inf. Syst., 2006

Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach.
ACM Trans. Database Syst., 2006

Sequence Homology Search Based on Database Indexing Using the Profile Hidden Markov Model.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

2005
A Tree-Structured Index Allocation Method with Replication over Multiple Broadcast Channels in Wireless Environments.
IEEE Trans. Knowl. Data Eng., 2005

A hybrid index structure for querying large string databases.
Int. J. Electron. Bus., 2005

The Hybrid Digital Tree: A New Indexing Technique for Large String Databases.
Proceedings of the ICEIS 2005, 2005

2004
Similarity between Euclidean and cosine angle distance for nearest neighbor queries.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

2003
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

2002
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps.
IEEE Trans. Knowl. Data Eng., 2002

A Histogramm with Perceptually Smooth Color Transition for Image Retrieval.
Proceedings of the 6th Joint Conference on Information Science, 2002

Segmentation and histogram generation using the HSV color space for image retrieval.
Proceedings of the 2002 International Conference on Image Processing, 2002

A comparative analysis of two distance measures in color image databases.
Proceedings of the 2002 International Conference on Image Processing, 2002

2001
Clustered SS-Tree.
Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, 2001

2000
The RDP (Ribosomal Database Project) continues.
Nucleic Acids Res., 2000

Conceptual Level Graph Theoretic Design and Development of Complex Information System.
Proceedings of the 2000 International Symposium on Information Technology (ITCC 2000), 2000

Performance Analysis of AB-Tree.
Proceedings of the 2000 IEEE International Conference on Multimedia and Expo, 2000

1999
A new version of the RDP (Ribosomal Database Project).
Nucleic Acids Res., 1999

HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees.
Bioinform., 1999

An Efficient Searching Algorithm for Approximate Nearest Neighbor Queries in High Dimensions.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions.
Proceedings of the 15th International Conference on Data Engineering, 1999

1998
Extending Relational Algebra to Incorporate Characteristics of Temporal Data.
Proceedings of the Third International Conference on Integrated Design and Process Technology, IDPT, 1998

1997
The NUMA with Clusters of Processors for Parallel Join.
IEEE Trans. Knowl. Data Eng., 1997

1996
Description and Identification of Distributed Fragments of Recursive Relations.
IEEE Trans. Knowl. Data Eng., 1996

Alignment of possible secondary structures in multiple RNA sequences using simulated annealing.
Comput. Appl. Biosci., 1996

Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing.
Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, 1996

HiTi Graph Model of Topographical Roadmaps in Navigation Systems.
Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

1995
Distributed Load Balancing for Parallel Main Memory Hash Join.
IEEE Trans. Parallel Distributed Syst., 1995

Reliable Semantics for Extended Logic Programs with Rule Prioritization.
J. Log. Comput., 1995

A new data model for biological classification.
Comput. Appl. Biosci., 1995

An Efficient Representation of Distributed Fragments of Recursive Relations.
Proceedings of the Database Systems for Advanced Applications '95, 1995

1994
Multiple sequence alignment using simulated annealing.
Comput. Appl. Biosci., 1994

Declarative Semantics for Contradictory Modular Logic Programs.
Proceedings of the Methodologies for Intelligent Systems, 8th International Symposium, 1994

An Efficient Method for Multiple Sequence Alignment.
Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, 1994

Semantics for Reasoning with Contradictory Extended Logic Programs.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993
Multi-Directory Hashing.
Inf. Syst., 1993

Performance Analysis of a Main Memory Multi-Directory Hashing Technique.
Inf. Process. Lett., 1993

A Distributed Load Balancing Scheme for Data Parallel Applications.
Proceedings of the 1993 International Conference on Parallel Processing, 1993

Panel: Scientific Databases.
Proceedings of the Foundations of Data Organization and Algorithms, 1993

1992
Join and Semi-join Algorithms Based on Partial-relation Schemes.
Comput. J., 1992

Optimizing Database Accesses for Parallel Processing of Multikey Range Searches.
Comput. J., 1992

Fast Search in Main Memory Databases.
Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, 1992

Fragmentation of Recursive Relations in Distributed Datbases.
Proceedings of the Advances in Database Technology, 1992

1991
The FX Distribution Method for Parallel Processing of Partial Match Queries.
Inf. Process. Lett., 1991

Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard.
Inf. Process. Lett., 1991

1990
Parallel Processing of Large Node B-Trees.
IEEE Trans. Computers, 1990

Distributed Linear Hashing and Parallel Projection in Main Memory Databases.
Proceedings of the 16th International Conference on Very Large Data Bases, 1990

A High Speed Main Memory File System for Shared Memory Multi-Processor Systems.
Proceedings of the Databases: Theory, 1990

Distributed Linear Hashing for Main Memory Databases.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989
Optimal Secondary Storage Access Sequence for Performing Relational Join.
IEEE Trans. Knowl. Data Eng., 1989

Database Processing Models in Parallel Processing Systems.
Proceedings of the Database Machines, Sixth International Workshop, 1989

On the Data Distribution Problems for Range Queries.
Proceedings of the International Conference on Parallel Processing, 1989

1988
Optimizing Join Queries in Distributed Databases.
IEEE Trans. Software Eng., 1988

Optimizing the cost of relational queries using Partial-Relation schemes.
Inf. Syst., 1988

HCB-Tree: A Height Compressed B-Tree for Parallel Processing.
Inf. Process. Lett., 1988

Optimal File Distribution For Partial Match Retrieval.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

1987
HCB-Tree: A B-Tree Structure for Parallel Processing.
Proceedings of the International Conference on Parallel Processing, 1987

Optimizing Join Queries in Distributed Database.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
Performance Analysis of a Database Filter Search Hardware.
IEEE Trans. Computers, 1986

Index Database Machine.
Comput. J., 1986

1985
Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join.
ACM Trans. Database Syst., 1985

A Hardware Pattern Matching Algorithm on a Dataflow.
Comput. J., 1985

1984
The implementation kit with monitors.
ACM SIGPLAN Notices, 1984

1983
Implementing set-theoretic relational-query functions using highly parallel index-processing hardware.
Proceedings of the American Federation of Information Processing Societies: 1983 National Computer Conference, 1983

1982
Database filters.
Proceedings of the 9th International Symposium on Computer Architecture (ISCA 1982), 1982

1981
Hardware Organization for Nonnumeric Processing
Proceedings of the Very Large Data Bases, 1981

Highly parallel associative search and its application to cellular database machine design.
Proceedings of the American Federation of Information Processing Societies: 1981 National Computer Conference, 1981

1980
A mathematical model of character string manipulation.
Proceedings of the American Federation of Information Processing Societies: 1980 National Computer Conference, 1980

1979
A data-handling mechanics of on-line text editing system with efficient secondary storage access.
Proceedings of the 1979 International Workshop on Managing Requirements Knowledge, 1979


  Loading...