Effective Search Mechanism For Finding Nearest Healthcare Facilities

被引:0
|
作者
Abinaya, M. [1 ]
Ganesan, R. [2 ]
机构
[1] Velammal Engn Coll, TIFAC CORE Pervas Comp Technol, Mobile & Pervas Comp, Madras 600066, Tamil Nadu, India
[2] Velammal Engn Coll, TIFAC CORE Pervas Comp Technol, Madras 600066, Tamil Nadu, India
关键词
Android; GPS; filtering; Google API; spatial coordinates; Healthcare facilities;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Android Smartphones are increasing in day-to-day life with lots of features including GPS, Wi-Fi, camera, 3G etc., which are replacing the bulky desktops. Health care systems are designed to fulfill the health care wants of individuals. Areas like biotechnology, pharmaceutical drugs, information technology, the event of medical devices and equipment and more have all made significant contribution to improving the health of the people all around the world. Database can be created with the parameterized value of location address. In this work, the Information Retrieval R-Tree Algorithm is used for fetching data with spatial, textual filtering and document ranking from bulky database or network is described. The major constraint is that time taken for data handling and network issues are more. In order to overcome the constraint, Information Retrieval R-Tree algorithm is used to show the nearest location of Relevant details with the K-Nearest Neighbor query technique and getting connected with Google API for routing. This technique is implemented using Ahuja-Dijkstra's algorithm with Fibonacci Heap and Priority queue which helps in analyzing the road length and distance to give the shortest route and nearest facilities.
引用
收藏
页码:522 / 526
页数:5
相关论文
共 50 条
  • [41] Copper Alloy Touch Surfaces in Healthcare Facilities: An Effective Solution to Prevent Bacterial Spreading
    Colin, Marius
    Klingelschmitt, Flora
    Charpentier, Emilie
    Josse, Jerome
    Kanagaratnam, Lukshe
    De Champs, Christophe
    Gangloff, Sophie C.
    MATERIALS, 2018, 11 (12)
  • [42] Effective optimizations of cluster-based nearest neighbor search in high-dimensional space
    Feng, Xiaokang
    Cui, Jiangtao
    Liu, Yingfan
    Li, Hui
    MULTIMEDIA SYSTEMS, 2017, 23 (01) : 139 - 153
  • [43] HEALTHCARE FACILITIES A beacon for free healthcare in Pakistan
    Burki, Talha
    BMJ-BRITISH MEDICAL JOURNAL, 2016, 352
  • [44] Approximate Nearest Neighbor Search on Standard Search Engines
    Carrara, Fabio
    Vadicamo, Lucia
    Gennaro, Claudio
    Amato, Giuseppe
    SIMILARITY SEARCH AND APPLICATIONS (SISAP 2022), 2022, 13590 : 214 - 221
  • [45] FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS
    HAREL, D
    TARJAN, RE
    SIAM JOURNAL ON COMPUTING, 1984, 13 (02) : 338 - 355
  • [46] Evaluation of fast algorithms for finding the nearest neighbor
    Lubiarz, S
    Lockwood, P
    1997 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I - V: VOL I: PLENARY, EXPERT SUMMARIES, SPECIAL, AUDIO, UNDERWATER ACOUSTICS, VLSI; VOL II: SPEECH PROCESSING; VOL III: SPEECH PROCESSING, DIGITAL SIGNAL PROCESSING; VOL IV: MULTIDIMENSIONAL SIGNAL PROCESSING, NEURAL NETWORKS - VOL V: STATISTICAL SIGNAL AND ARRAY PROCESSING, APPLICATIONS, 1997, : 1491 - 1494
  • [47] FINDING THE NEAREST POSITIVE-REAL SYSTEM
    Gillis, Nicolas
    Sharma, Punit
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2018, 56 (02) : 1022 - 1047
  • [48] Efficient bounds in finding Aggregate Nearest Neighbors
    Namnandorj, Sansarkhuu
    Chen, Hanxiong
    Furuse, Kazutaka
    Ohbo, Nobuo
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2008, 5181 : 693 - 700
  • [49] ITERATED NEAREST NEIGHBORS AND FINDING MINIMAL POLYTOPES
    EPPSTEIN, D
    ERICKSON, J
    DISCRETE & COMPUTATIONAL GEOMETRY, 1994, 11 (03) : 321 - 350
  • [50] Algorithm for finding all k nearest neighbors
    Piegl, LA
    Tiller, W
    COMPUTER-AIDED DESIGN, 2002, 34 (02) : 167 - 172