In this abstract, we analyze public sentiment variations on Twitter and mine possible reasons behind such variations. To track public sentiment, we combine two state-of-the-art sentiment analysis tools to obtain sentiment information towards interested targets (e.g., “Obama”) in each tweet. Based on the sentiment label obtained for each tweet, we can track the public sentiment […]
ANONYMITY BASED ACCURACY-CONSTRAINED PRIVACY-PRESERVING ACCESS CONTROL FRAMEWORK FOR RELATIONAL DATA
In this abstract the focus is on a static relational table that is anonymized only once. To exemplify our approach, role-based access control is assumed. However, the concept of accuracy constraints for permissions can be applied to any privacy-preserving security policy, e.g., discretionary access control. The heuristics proposed in this abstract for accuracy-constrained privacy-preserving access […]
RELATIONAL DATA WITH ACCURACY-CONSTRAINED PRIVACY-PRESERVING ACCESS CONTROL FRAMEWORK
The concept of privacy-preservation for sensitive data can require the enforcement of privacy policies or the protection against identity disclosure by satisfying some privacy requirements. In this abstract, we investigate privacy-preservation from the anonymity aspect. The sensitive information, even after the removal of identifying attributes, is still susceptible to linking attacks by the authorized users. […]
A NOVEL CONSENSUS-BASED RANKING METHOD FOR THE PROBLEM OF TOP-K QUERY ON MULTIVALUED OBJECTS
A novel consensus-based ranking method, named BC ranking, is proposed for the problem of top k query on multivalued objects. The Effective and efficient algorithms are developed to compute the top k query based on BC ranks. The Effective pruning techniques are proposed to significantly improve the performance in terms of CPU and I/O costs. […]
EFFECTIVE AND EFFICIENT BORDA COUNT APPROACH USING INDEX BASED ALGORITHM FOR TOP-K QUERY ON MULTIVALUED OBJECTS
As ranking is an essential analytic method, it is natural and fundamental to investigate how to rank a set of multivalued objects. To the best of our knowledge, however, there is no existing work addressing this important problem systematically. One may think we may simply rank multivalued objects as uncertain/probabilistic data. However, the models of […]
PREDICTING THE DEGREE OF THE DIFFICULTY FOR KEYWORD QUERIES OVER DATABASES
In Keyword Query Interface, any entity in a data set that contains the query keywords is a potential answer, keyword queries typically have many possible answers. KQIs must identify the information needs behind keyword queries and rank the answers so that the desired answers appear at the top of the list. In this abstract, we […]
A NOVEL FRAMEWORK TO MEASURE THE DEGREE OF DIFFICULTY FOR A KEYWORD QUERY OVER A DATABASE
In this abstract, we analyze the characteristics of difficult queries over databases and propose a novel method to detect such queries. We propose the Structured Robustness (SR) score, which measures the difficulty of a query based on the differences between the rankings of the same query over the original and noisy (corrupted) versions of the […]
SET PREDICATES IN SQL: ENABLING SET-LEVEL COMPARISONS USING AGGREGATE FUNCTION AND BITMAP INDEX-BASED APPROACHES FOR DYNAMICALLY FORMED GROUPS
This abstract proposed to extend SQL with set predicates for an important class of analytical queries, which otherwise would be difficult to write and optimize. It designed two query evaluation approaches for set predicates, including an aggregate function-based approach and a bitmap index-based approach. Aggregate function-based approach processes set predicates in a way similar to […]
SUPPORTING PRIVACY PROTECTION IN PROFILE-BASED PERSONALIZED WEB SEARCH
Personalized web search (PWS) is a general category of search techniques aiming at providing better search results, which are tailored for individual user needs. As the expense, user information has to be collected and analyzed to figure out the user intention behind the issued query. The solutions to PWS can generally be categorized into two […]
AGGREGATE FUNCTION AND BITMAP INDEX-BASED SET PREDICATES IN SQL FOR DYNAMICALLY FORMED GROUPS
Data warehousing and OLAP applications becoming more sophisticated, there is a high demand of querying data with the semantics of set-level comparisons. The proposed concise syntax of set predicates enables direct expression of set-level comparisons in SQL, which not only makes query formulation simple but also facilitates efficient support of such queries. In data warehousing […]
- « Previous Page
- 1
- 2
- 3
- 4
- 5
- 6
- …
- 9
- Next Page »