Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Sakti Pramanik

Papers on DiSC'04


The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces

Publications


Note: Links lead to the DBLP on the Web.

Sakti Pramanik

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

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

Shamik Sural , Gang Qian , Sakti Pramanik: A Histogramm with Perceptually Smooth Color Transition for Image Retrieval. JCIS 2002 : 664-667

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)

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

S. Choudhury , Nabendu Chaki , Sakti Pramanik, Swapan Bhattacharya : Conceptual Level Graph Theoretic Design and Development of Complex Information System. ITCC 2000 : 449-454

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 Research 28 (1): 173-174 (2000)

Sakti Pramanik, Jinhua Li : Fast Approximate Search Algorithm for Nearest Neighbor Queries in High Dimensions. ICDE 1999 : 251

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

Y. Zhong , Y. Luo , Sakti Pramanik, J. H. Beaman : HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees. Bioinformatics 15 (2): 149-156 (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 Research 27 (1): 171-173 (1999)

Jaruloj Eamsiri Chongstitvatana , Sakti Pramanik: Extending Relational Algebra to Incorporate Characteristics of Temporal Data. IADT 1998 : 328-335

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

Sungwon Jung , Sakti Pramanik: HiTi Graph Model of Topographical Roadmaps in Navigation Systems. ICDE 1996 : 76-84

Jin Kim , James R. Cole , Eric Torng , Sakti Pramanik: Inferring Relatedness of a Macromolecule to a Sequence Database Without Sequencing. ISMB 1996 : 125-133

Jin Kim , James R. Cole , Sakti Pramanik: Alignment of possible secondary structures in multiple RNA sequences using simulated annealing. Computer Applications in the Biosciences 12 (4): 259-267 (1996)

Sakti Pramanik, Sungwon Jung : Description and Identification of Distributed Fragments of Recursive Relations. IEEE Trans. Knowl. Data Eng. 8 (6): 1002-1016 (1996)

Sungwon Jung , Sakti Pramanik: An Efficient Representation of Distributed Fragments of Recursive Relations. DASFAA 1995 : 397-404

S. Jung , S. Perkins , Y. Zhong , Sakti Pramanik, J. H. Beaman : A new data model for biological classification. Computer Applications in the Biosciences 11 (3): 237-246 (1995)

Walid R. Tout , Sakti Pramanik: Distributed Load Balancing for Parallel Main Memory Hash Join. IEEE Trans. Parallel Distrib. Syst. 6 (8): 841-849 (1995)

Anastasia Analyti , Sakti Pramanik: Reliable Semantics for Extended Logic Programs with Rule Prioritization. J. Log. Comput. 5 (3): 303-324 (1995)

Jin Kim , Sakti Pramanik: An Efficient Method for Multiple Sequence Alignment. ISMB 1994 : 212-218

Anastasia Analyti , Sakti Pramanik: Declarative Semantics for Contradictory Modular Logic Programs. ISMIS 1994 : 245-254

Jin Kim , Sakti Pramanik, M. J. Chung : Multiple sequence alignment using simulated annealing. Computer Applications in the Biosciences 10 (4): 419-426 (1994)

Robert L. Grossman , Yannis E. Ioannidis , Edward May , Sakti Pramanik, Ruth Pordes : Panel: Scientific Databases. FODO 1993 : 361

Walid R. Tout , Sakti Pramanik: A Distributed Load Balancing Scheme for Data Parallel Applications. ICPP 1993 : 213-216

Anastasia Analyti , Sakti Pramanik: Performance Analysis of a Main Memory Multi-Directory Hashing Technique. Inf. Process. Lett. 45 (4): 191-197 (1993)

Sakti Pramanik, David T. Kao , David Vineyard : Fragmentation of Recursive Relations in Distributed Datbases. EDBT 1992 : 389-404

Anastasia Analyti , Sakti Pramanik: Fast Search in Main Memory Databases. SIGMOD Conference 1992 : 215-224

Myoung-Ho Kim , Sakti Pramanik: Optimizing Database Accesses for Parallel Processing of Multikey Range Searches. Comput. J. 35 (1): 45-51 (1992)

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

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)

Charles Severance , Sakti Pramanik: Distributed Linear Hashing for Main Memory Databases. ICPP (1) 1990 : 92-95

Sakti Pramanik, Charles Severance , Todd Rosenau : A High Speed Main Memory File System for Shared Memory Multi-Processor Systems. PARBASE / Databases 1990 : 187-203

Charles Severance , Sakti Pramanik, P. Wolberg : Distributed Linear Hashing and Parallel Projection in Main Memory Databases. VLDB 1990 : 674-682

Sakti Pramanik, Myoung-Ho Kim : Parallel Processing of Large Node B-Trees. IEEE Trans. Computers 39 (9): 1208-1212 (1990)

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

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

Myoung-Ho Kim , Sakti Pramanik: Optimal File Distribution For Partial Match Retrieval. SIGMOD Conference 1988 : 173-182

Sakti Pramanik, David Vineyard : Optimizing Join Queries in Distributed Databases. IEEE Trans. Software Eng. 14 (9): 1319-1326 (1988)

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

Sakti Pramanik, Farshad Fotouhi : Optimizing the cost of relational queries using Partial-Relation schemes. Inf. Syst. 13 (1): 71-79 (1988)

Sakti Pramanik, David Vineyard : Optimizing Join Queries in Distributed Database. FSTTCS 1987 : 282-304

Sakti Pramanik, Myoung-Ho Kim : HCB-Tree: A B-Tree Structure for Parallel Processing. ICPP 1987 : 140-146

Sakti Pramanik, Farshad Fotouhi : Index Database Machine. Comput. J. 29 (5): 451-457 (1986)

Sakti Pramanik: Performance Analysis of a Database Filter Search Hardware. IEEE Trans. Computers 35 (12): 1077-1082 (1986)

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)

Sakti Pramanik, Chung-Ta King : A Hardware Pattern Matching Algorithm on a Dataflow. Comput. J. 28 (3): 264-269 (1985)

Sakti Pramanik: Hardware Organization for Nonnumeric Processing VLDB 1981 : 66-75

1 [ 41 ]

2 [ 21 ] [ 23 ] [ 27 ] [ 29 ]

3 [ 31 ] [ 40 ]

4 [ 44 ]

5 [ 44 ]

6 [ 38 ]

7 [ 44 ]

8 [ 26 ]

9 [ 34 ] [ 35 ] [ 39 ] [ 43 ]

10 [ 5 ] [ 8 ] [ 12 ] [ 18 ]

11 [ 39 ] [ 43 ]

12 [ 25 ]

13 [ 49 ]

14 [ 25 ]

15 [ 3 ]

16 [ 31 ]

17 [ 32 ] [ 33 ] [ 36 ] [ 46 ]

18 [ 22 ]

19 [ 26 ] [ 28 ] [ 34 ] [ 35 ]

20 [ 6 ] [ 9 ] [ 11 ] [ 13 ] [ 14 ] [ 19 ] [ 20 ]

21 [ 2 ]

22 [ 39 ]

23 [ 39 ] [ 43 ]

24 [ 41 ] [ 42 ] [ 45 ]

25 [ 39 ] [ 43 ]

26 [ 40 ]

27 [ 39 ] [ 43 ]

28 [ 25 ]

29 [ 39 ]

30 [ 39 ] [ 43 ]

31 [ 39 ]

32 [ 39 ] [ 43 ]

33 [ 31 ]

34 [ 25 ]

35 [ 47 ] [ 48 ] [ 49 ]

36 [ 16 ]

37 [ 45 ]

38 [ 43 ]

39 [ 39 ] [ 43 ]

40 [ 15 ] [ 16 ] [ 17 ]

41 [ 43 ]

42 [ 47 ] [ 49 ]

43 [ 39 ] [ 43 ]

44 [ 35 ]

45 [ 24 ] [ 30 ] [ 37 ]

46 [ 7 ] [ 10 ] [ 22 ]

47 [ 39 ]

48 [ 15 ]

49 [ 48 ]

50 [ 31 ] [ 40 ]

51 [ 48 ]




©2004 Association for Computing Machinery