Phd Projects | IEEE Project | IEEE Projects 2020-19 in Trichy & Chennai

IEEE Projects Trichy, Best IEEE Project Centre Chennai, Final Year Projects in Trichy - We Provide IEEE projects 2018 - 2019 , IEEE 2018 Java Projects for M.E/M.Tech, IEEE 2018 Dot net Projects for B.E/B.Tech, IEEE 2018 Power electronics Projects Engineering & Diploma Students, Matlab, Embedded, NS2 Projects

MULTILEVEL INTER- RELATIONSHIP GRAPH FOR KEYWORD QUERY ROUTING

by

Conventional keyword search engines are restricted to a given data model and cannot easily adapt to unstructured, semi-structured or structured data. Keyword search is an intuitive paradigm for searching linked data sources on the web. We propose to route keywords only to relevant sources to reduce the high cost of processing keyword search queries over […]

KEYWORD QUERY ROUTING FOR KEYWORD SEARCH OVER A LINKED DATA SOURCES

by

This abstract proposed to identify data sources that contain results to a keyword query. The goal is to produce routing plans, which can be used to compute results from multiple sources. Keyword search is an intuitive paradigm for searching linked data sources on the web. We propose to route keywords only to relevant sources to […]

COLLABORATIVE ADAPTIVE DATA SHARING PLATFORM FOR FACILITATING DOCUMENT ANNOTATION USING CONTENT AND QUERYING VALUE

by

We propose Collaborative Adaptive Data Sharing platform (CADS), which is an “annotate-as-you-create” infrastructure that facilitates fielded data annotation. A key contribution of our system is the direct use of the query workload to direct the annotation process, in addition to examining the content of the document. A large number of organizations today generate and share […]

CONTENT AND QUERYING VALUE BASED DOCUMENT ANNOTATION

by

Annotations are comments, notes, explanations, or other types of external remarks that can be attached to a Web document or to a selected part of a document. As they are external, it is possible to annotate any Web document independently, without needing to edit the document itself. From a technical point of view, annotations are […]

RUNTIME PERFORMANCE EVALUATION OF RELATIONAL KEYWORD SEARCH TECHNIQUE

by

Keyword search on semi structured data (e.g., XML) and relational data differs considerably from traditional IR. A discrepancy exists between the data’s physical storage and a logical view of the information. Relational databases are normalized to eliminate redundancy, and foreign keys identify related information. Extending the keyword search paradigm to relational data has been an […]

RUNTIME PERFORMANCE EVALUATION OF RELATIONAL KEYWORD SEARCH TECHNIQUE

by

Keyword search on semi structured data (e.g., XML) and relational data differs considerably from traditional IR. A discrepancy exists between the data’s physical storage and a logical view of the information. Relational databases are normalized to eliminate redundancy, and foreign keys identify related information. Extending the keyword search paradigm to relational data has been an […]

RELATIONAL KEYWORD SEARCH TECHNIQUES BASED ON AN EMPIRICAL PERFORMANCE EVALUATION

by

Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing many issues, including robustness, accuracy, reliability, and privacy. An emerging issue, however, appears to be performance related: current KWS systems have unpredictable running times. In this paper, we present the most extensive […]

PRIVACY IN DATA PUBLICATION OF SOCIAL NETWORKS

by

The first necessary anonymization technique in both the contexts of micro- and network data consists in removing identification. This nave technique has quickly been recognized as failing to protect privacy. For microdata, Sweeney et al. propose k-anonymity to circumvent possible identity disclosure in naively anonymized microdata. `-diversity is proposed in order to further prevent attribute […]

THE L SENSITIVE LABEL DIVERSITY REQUIREMENT

by

The publication of social network data entails a privacy threat for their users. Sensitive information about users of the social networks should be protected. The challenge is to devise methods to publish social network data in a form that affords utility without compromising privacy. Previous research has pro- posed various privacy models with the corresponding […]

A secure multiparty protocol for computing the OR of private binary vectors

by

The problem of secure mining of association rules in horizontally partitioned databases. In that setting, there are several sites (or players) that hold homogeneous databases, i.e., databases that share the same schema but hold information on different entities. The goal is to find all association rules with support at least s and confidence at least […]