Scribd Logo
Upload

Welcome to Scribd!

  • 208 views

    Nearest Keyword Set Search in Multidimensional Datasets

    Uploaded by

    Shaka Technologies
    Shakas Technologies Provides, 2016-2017 Projects, Academic Projects, Real time project , IEEE Project 2016-2017, NON-IEEE Project Titles, Latest project titles 2016, Shakas Training and Development, Shakas Sales and Services, Shakas Technologies Educational Trust, Contact As: Vellore Office : Shakas Technologies #13/19, 1st Floor, Municipal Colony, Kangeyanellore Road, Gandhi Nagar, Vellore-632006, Mobile: 9500218218 LandLine: 0416-2247353 / 6066663 Email : [email protected], Website: www.shakastech.com.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Nearest Keyword Set Search in Multidimensional Datasets

    Uploaded by

    Shaka Technologies
    208 views3 pages
    Shakas Technologies Provides, 2016-2017 Projects, Academic Projects, Real time project , IEEE Project 2016-2017, NON-IEEE Project Titles, Latest project titles 2016, Shakas Training and Development, Shakas Sales and Services, Shakas Technologies Educational Trust, Contact As: Vellore Office : Shakas Technologies #13/19, 1st Floor, Municipal Colony, Kangeyanellore Road, Gandhi Nagar, Vellore-632006, Mobile: 9500218218 LandLine: 0416-2247353 / 6066663 Email : [email protected], Website: www.shakastech.com.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Shakas Technologies Provides, 2016-2017 Projects, Academic Projects, Real time project , IEEE Project 2016-2017, NON-IEEE Project Titles, Latest project titles 2016, Shakas Training and Development, Shakas Sales and Services, Shakas Technologies Educational Trust, Contact As: Vellore Office : Shakas Technologies #13/19, 1st Floor, Municipal Colony, Kangeyanellore Road, Gandhi Nagar, Vellore-632006, Mobile: 9500218218 LandLine: 0416-2247353 / 6066663 Email : [email protected], Website: www.shakastech.com.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    208 views3 pages

    Nearest Keyword Set Search in Multidimensional Datasets

    Uploaded by

    Shaka Technologies
    Shakas Technologies Provides, 2016-2017 Projects, Academic Projects, Real time project , IEEE Project 2016-2017, NON-IEEE Project Titles, Latest project titles 2016, Shakas Training and Development, Shakas Sales and Services, Shakas Technologies Educational Trust, Contact As: Vellore Office : Shakas Technologies #13/19, 1st Floor, Municipal Colony, Kangeyanellore Road, Gandhi Nagar, Vellore-632006, Mobile: 9500218218 LandLine: 0416-2247353 / 6066663 Email : [email protected], Website: www.shakastech.com.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    NEAREST KEYWORD SET SEARCH IN MULTIDIMENSIONAL DATASETS

    ABSTRACT
    Keyword-based search in text-rich multi-dimensional datasets facilitates many novel
    applications and tools. In this paper, we consider objects that are tagged with keywords and are
    embedded in a vector space. For these datasets, we study queries that ask for the tightest groups
    of points satisfying a given set of keywords. We propose a novel method called ProMiSH
    (Projection and Multi Scale Hashing) that uses random projection and hash-based index
    structures, and achieves high scalability and speedup. We present an exact and an approximate
    version of the algorithm. Our empirical studies, both on real and synthetic datasets, show that
    ProMiSH has a speedup of more than four orders over state-of-the-art tree-based techniques. Our
    scalability tests on datasets of sizes up to 10 million and dimensions up to 100 for queries having
    up to 9 keywords show that ProMiSH scales linearly with the dataset size, the dataset dimension,
    the query size, and the result
    EXISTING SYSTEM:
    In this paper, we study nearest keyword set (referred to as NKS) queries on text-rich
    multi-dimensional datasets. An NKS query is a set of user-provided keywords, and the result of
    the query may include k sets of data points each of which contains all the query keywords and
    forms one of the top-k tightest clusters in the multi-dimensional space. NKS query over a set of
    two-dimensional data points. In tree-based indexes suggest possible solutions to NKS queries on
    multidimensional datasets, the performance of these algorithms deteriorates sharply with the
    increase of size or dimensionality in datasets.
    DISADVANTAGES:

    #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar,
    Vellore 6.
    Off: 0416-2247353 / 6066663 Mo: +91 9500218218
    Website: www.shakastech.com, Email - id: [email protected],
    [email protected]

    NKS queries are useful for graph pattern search, where labeled graphs are embedded in a

    high dimensional space.


    Nearest neighbor queries usually require coordinate information for queries, which makes
    it difficult to develop an efficient method to solve NKS queries by existing techniques for
    nearest neighbor search.

    EXISTING ALGORITHM

    K-nearest shortest path algorithm

    PROPOSED SYSTEM:
    In this paper, we propose ProMiSH (short for Projection and Multi-Scale Hashing) to
    enable fast processing for NKS queries. In particular, we develop an exact ProMiSH (referred to
    as ProMiSH-E) that always retrieves the optimal top-k results, and an approximate ProMiSH
    (referred to as ProMiSH-A) that is more efficient in terms of time and space, and is able to obtain
    near-optimal results in practice. ProMiSH-E uses a set of hash tables and inverted indexes to
    perform a localized search. Based on this index, we developed ProMiSH-E that finds an optimal
    subset of points and ProMiSH-A which searches near-optimal results with better efficiency.
    ProMiSH is faster than state-of-the-art tree-based techniques, with multiple orders of magnitude
    performance improvement.
    ADVANTAGES:

    The performance of ProMiSH on both real and synthetic datasets.


    We develop efficient search algorithms that work with the multi-scale indexes for fast
    query processing.

    PROPOSED ALGORITHM
    #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar,
    Vellore 6.
    Off: 0416-2247353 / 6066663 Mo: +91 9500218218
    Website: www.shakastech.com, Email - id: [email protected],
    [email protected]

    STP Algorithm

    #13/ 19, 1st Floor, Municipal Colony, Kangayanellore Road, Gandhi Nagar,
    Vellore 6.
    Off: 0416-2247353 / 6066663 Mo: +91 9500218218
    Website: www.shakastech.com, Email - id: [email protected],
    [email protected]

    You might also like