Travelled to:1 × Australia
1 × Cyprus
1 × France
1 × Germany
1 × USA
2 × Italy
Collaborated with:G.Qian Q.Zhu Q.Xue A.Analyti M.Kim ∅ S.Shahid C.B.Owen C.Severance P.Wolberg A.Watve C.R.Meiners A.X.Liu C.Chen S.Sural Y.Gu
Talks about:databas (3) queri (3) index (3) distribut (2) techniqu (2) memori (2) hybrid (2) space (2) optim (2) tree (2)
Person: Sakti Pramanik
DBLP: Pramanik:Sakti
Contributed to:
2012
2010
2009200520042003
1992199019881981Wrote 10 papers:
- SAC-2012-ShahidPO #bound
- Minimum bounding boxes for regular cross-polytopes (SS, SP, CBO), pp. 879–884.
- VLDB-2010-PramanikWML #query
- Transforming Range Queries To Equivalent Box Queries To Optimize Page Access (SP, AW, CRM, AXL), pp. 409–416.
- ICEIS-J-2009-ChenPZQ #case study #hybrid
- A Study of Indexing Strategies for Hybrid Data Spaces (CC, SP, QZ, GQ), pp. 149–159.
- ICEIS-v1-2005-XuePQZ #database #hybrid #scalability #string
- The Hybrid Digital Tree: A New Indexing Technique for Large String Databases (QX, SP, GQ, QZ), pp. 115–121.
- SAC-2004-QianSGP #distance #nearest neighbour #query #similarity
- Similarity between Euclidean and cosine angle distance for nearest neighbor queries (GQ, SS, YG, SP), pp. 1232–1237.
- VLDB-2003-QianZXP #multi
- The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces (GQ, QZ, QX, SP), pp. 620–631.
- SIGMOD-1992-AnalytiP #database #in memory #memory management #performance
- Fast Search in Main Memory Databases (AA, SP), pp. 215–224.
- VLDB-1990-SeverancePW #database #distributed #in memory #linear #memory management #parallel
- Distributed Linear Hashing and Parallel Projection in Main Memory Databases (CS, SP, PW), pp. 674–682.
- SIGMOD-1988-KimP #retrieval
- Optimal File Distribution For Partial Match Retrieval (MHK, SP), pp. 173–182.
- VLDB-1981-Pramanik #hardware
- Hardware Organization for Nonnumeric Processing (SP), pp. 66–75.