International Journal of Advance Computational Engineering and Networking (IJACEN)
.
Follow Us On :
current issues
Volume-12,Issue-1  ( Jan, 2024 )
Past issues
  1. Volume-11,Issue-12  ( Dec, 2023 )
  2. Volume-11,Issue-11  ( Nov, 2023 )
  3. Volume-11,Issue-10  ( Oct, 2023 )
  4. Volume-11,Issue-9  ( Sep, 2023 )
  5. Volume-11,Issue-8  ( Aug, 2023 )
  6. Volume-11,Issue-7  ( Jul, 2023 )
  7. Volume-11,Issue-6  ( Jun, 2023 )
  8. Volume-11,Issue-5  ( May, 2023 )
  9. Volume-11,Issue-4  ( Apr, 2023 )
  10. Volume-11,Issue-3  ( Mar, 2023 )

Statistics report
Apr. 2024
Submitted Papers : 80
Accepted Papers : 10
Rejected Papers : 70
Acc. Perc : 12%
Issue Published : 133
Paper Published : 1552
No. of Authors : 4025
  Journal Paper


Paper Title :
Geo-Social K-Cover Group Queries For Collaborative Activity Planning

Author :Priyanka C Hiremath, G. T. Raju

Article Citation :Priyanka C Hiremath ,G. T. Raju , (2016 ) " Geo-Social K-Cover Group Queries For Collaborative Activity Planning " , International Journal of Advance Computational Engineering and Networking (IJACEN) , pp. 1-3, Volume-4, Issue-7

Abstract : Good amount of personal information is available due to fast growth and development of ubiquitous internet access, location- aware mobile devices and social computing technologies, hence location data and social data from various mobile platforms and online social networks are readily available and accessible. The combination or convergence of these two types of data that is, location data and social data is known as geo-social data. This convergence has enabled collaborative spatial computing, which means explicit combination of location and social factors to answer our required useful geo-social queries for either the purpose of social good or business such as group decision making travel recommendation and spatial task outsourcing. In this paper, A new type of query known as Geo-Social K- Cover Group(GSKCG) queries is utilized. This query takes the given set of query points and social network, retrieve a user group, a minimum group where each user socially has social relation to at least K other users and users familiar regions, so that social relations and associated regions jointly cover all the query points. We slowly explore effective pruning strategy to derive optimal solution group with an efficient algorithm. To accelerate the query processing we further design a novel index structure. Finally with efficient pruning strategy and novel index structure, a minimum user group which covers all the query points is retrieved. Keywords— Location-Based Services, Query Processing, Social Constraints, Group Queries.

Type : Research paper

Published : Volume-4, Issue-7


DOIONLINE NO - IJACEN-IRAJ-DOIONLINE-5143   View Here

Copyright: © Institute of Research and Journals

| PDF |
Viewed - 81
| Published on 2016-08-17
   
   
IRAJ Other Journals
IJACEN updates
Paper Submission is open now for upcoming Issue.
The Conference World

JOURNAL SUPPORTED BY