SlideShare a Scribd company logo
1 of 3
Download to read offline
Distance-Aware Join for Indoor Moving Objects
Abstract:
Indoor spaces accommodate large parts of people’s lives. Relevant
techniques are thus needed to efficiently manage indoor moving objects,
whose positions are detected by technologies, such as Assisted GPS, Wi-Fi,
RFID, and Bluetooth. Among such techniques, the distance-aware join
processing is of importance in practice for indoor spatial databases. Such
join operators leverage a series of applications, such as indoor mobile
service and facility monitoring. However, distance-aware joining over
indoor moving objects is challenging because: (1) indoor spaces are
characterized by many special entities and thus render distance calculation
very complex; (2) the limitations of indoor positioning technologies create
inherent uncertainties in indoor moving objects data. In this paper, we
study two representative join predicates in indoor settings, semi-range join
and semi-neighborhood join. To implement them, we define and categorize
the indoor distances between indoor uncertain objects, and derive different
distance bounds that can facilitate the join processing. We design a
composite index scheme that integrates indoor geometries, indoor
topologies, as well as indoor uncertain objects, and thus supports the join
processing efficiently. The results of extensive experimental studies
demonstrate that our proposals are efficient and scalable in evaluating
distance-aware join over indoor moving objects.
Existing System:
In the emerging indoor applications, distance-aware joins constitute a
series of expressive operators that are indispensable for indoor spatial data
management.
First of all, indoor spaces are characterized by entities such as walls, doors,
rooms, etc., which render euclidean distance and spatial network distance
unsuitable.
Proposed System:
First, we define the indoor distance between two moving objects Q and O,
whose locations are obtained through the aforementioned limited indoor
positioning. We choose the expected distance as it is both interpretative
and semantically comprehensive. By referring to the indoor topology, we
divide O’s imprecise location into disjoint subregions each falling into one
indoor partition (e.g., a room).
Subsequently, we classify the distances from Q and the subregions based
on the topological properties, and derive various distance bounds that can
remove non-qualifying join pairs without calculating detailed expected
indoor distances.
Hardware Requirements:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• RAM : 256 Mb.
Software Requirements:
• Operating system : - Windows XP.
• Front End : - JSP
• Back End : - SQL Server
Software Requirements:
• Operating system : - Windows XP.
• Front End : - .Net
• Back End : - SQL Server

More Related Content

Similar to Distance aware join for indoor moving objects

Informative Indoor Tracking
Informative Indoor TrackingInformative Indoor Tracking
Informative Indoor Tracking
paperpublications3
 
Pablo_Panero_Report
Pablo_Panero_ReportPablo_Panero_Report
Pablo_Panero_Report
Pablo Panero
 

Similar to Distance aware join for indoor moving objects (20)

Rfid based localization
Rfid based localizationRfid based localization
Rfid based localization
 
A Survey of Indoor Localization Techniques
A Survey of Indoor Localization TechniquesA Survey of Indoor Localization Techniques
A Survey of Indoor Localization Techniques
 
UNIT 1.pdf
UNIT 1.pdfUNIT 1.pdf
UNIT 1.pdf
 
Live Matches , Streaming , Scores
Live Matches , Streaming , ScoresLive Matches , Streaming , Scores
Live Matches , Streaming , Scores
 
Internal and external positioning in mobile and web applications
Internal and external positioning in mobile and web applicationsInternal and external positioning in mobile and web applications
Internal and external positioning in mobile and web applications
 
Indoor Tracking System
Indoor Tracking SystemIndoor Tracking System
Indoor Tracking System
 
Internet of Things (IoT): Micro-location and Smart Buildings
Internet of Things (IoT): Micro-location and Smart BuildingsInternet of Things (IoT): Micro-location and Smart Buildings
Internet of Things (IoT): Micro-location and Smart Buildings
 
iotarchitecture-190506052723.pdf
iotarchitecture-190506052723.pdfiotarchitecture-190506052723.pdf
iotarchitecture-190506052723.pdf
 
Iot architecture
Iot architectureIot architecture
Iot architecture
 
apchi08
apchi08apchi08
apchi08
 
5G VS WI-FI INDOOR POSITIONING: A COMPARATIVE STUDY
5G VS WI-FI INDOOR POSITIONING: A COMPARATIVE STUDY5G VS WI-FI INDOOR POSITIONING: A COMPARATIVE STUDY
5G VS WI-FI INDOOR POSITIONING: A COMPARATIVE STUDY
 
5G Vs Wi-Fi Indoor Positioning: A Comparative Study
5G Vs Wi-Fi Indoor Positioning: A Comparative Study5G Vs Wi-Fi Indoor Positioning: A Comparative Study
5G Vs Wi-Fi Indoor Positioning: A Comparative Study
 
JPJ1437 Exploiting Service Similarity for Privacy in Location-Based Search Q...
JPJ1437  Exploiting Service Similarity for Privacy in Location-Based Search Q...JPJ1437  Exploiting Service Similarity for Privacy in Location-Based Search Q...
JPJ1437 Exploiting Service Similarity for Privacy in Location-Based Search Q...
 
Informative Indoor Tracking
Informative Indoor TrackingInformative Indoor Tracking
Informative Indoor Tracking
 
X INTERNET
X INTERNETX INTERNET
X INTERNET
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
 
Wi-Fi based indoor positioning
Wi-Fi based indoor positioningWi-Fi based indoor positioning
Wi-Fi based indoor positioning
 
Wireless Indoor Localization with Dempster-Shafer Simple Support Functions
Wireless Indoor Localization with Dempster-Shafer Simple Support FunctionsWireless Indoor Localization with Dempster-Shafer Simple Support Functions
Wireless Indoor Localization with Dempster-Shafer Simple Support Functions
 
UNIT-2.pptx
UNIT-2.pptxUNIT-2.pptx
UNIT-2.pptx
 
Pablo_Panero_Report
Pablo_Panero_ReportPablo_Panero_Report
Pablo_Panero_Report
 

More from ieeepondy

More from ieeepondy (20)

Demand aware network function placement
Demand aware network function placementDemand aware network function placement
Demand aware network function placement
 
Service description in the nfv revolution trends, challenges and a way forward
Service description in the nfv revolution trends, challenges and a way forwardService description in the nfv revolution trends, challenges and a way forward
Service description in the nfv revolution trends, challenges and a way forward
 
Secure optimization computation outsourcing in cloud computing a case study o...
Secure optimization computation outsourcing in cloud computing a case study o...Secure optimization computation outsourcing in cloud computing a case study o...
Secure optimization computation outsourcing in cloud computing a case study o...
 
Spatial related traffic sign inspection for inventory purposes using mobile l...
Spatial related traffic sign inspection for inventory purposes using mobile l...Spatial related traffic sign inspection for inventory purposes using mobile l...
Spatial related traffic sign inspection for inventory purposes using mobile l...
 
Standards for hybrid clouds
Standards for hybrid cloudsStandards for hybrid clouds
Standards for hybrid clouds
 
Rfhoc a random forest approach to auto-tuning hadoop's configuration
Rfhoc a random forest approach to auto-tuning hadoop's configurationRfhoc a random forest approach to auto-tuning hadoop's configuration
Rfhoc a random forest approach to auto-tuning hadoop's configuration
 
Resource and instance hour minimization for deadline constrained dag applicat...
Resource and instance hour minimization for deadline constrained dag applicat...Resource and instance hour minimization for deadline constrained dag applicat...
Resource and instance hour minimization for deadline constrained dag applicat...
 
Reliable and confidential cloud storage with efficient data forwarding functi...
Reliable and confidential cloud storage with efficient data forwarding functi...Reliable and confidential cloud storage with efficient data forwarding functi...
Reliable and confidential cloud storage with efficient data forwarding functi...
 
Rebuttal to “comments on ‘control cloud data access privilege and anonymity w...
Rebuttal to “comments on ‘control cloud data access privilege and anonymity w...Rebuttal to “comments on ‘control cloud data access privilege and anonymity w...
Rebuttal to “comments on ‘control cloud data access privilege and anonymity w...
 
Scalable cloud–sensor architecture for the internet of things
Scalable cloud–sensor architecture for the internet of thingsScalable cloud–sensor architecture for the internet of things
Scalable cloud–sensor architecture for the internet of things
 
Scalable algorithms for nearest neighbor joins on big trajectory data
Scalable algorithms for nearest neighbor joins on big trajectory dataScalable algorithms for nearest neighbor joins on big trajectory data
Scalable algorithms for nearest neighbor joins on big trajectory data
 
Robust workload and energy management for sustainable data centers
Robust workload and energy management for sustainable data centersRobust workload and energy management for sustainable data centers
Robust workload and energy management for sustainable data centers
 
Privacy preserving deep computation model on cloud for big data feature learning
Privacy preserving deep computation model on cloud for big data feature learningPrivacy preserving deep computation model on cloud for big data feature learning
Privacy preserving deep computation model on cloud for big data feature learning
 
Pricing the cloud ieee projects, ieee projects chennai, ieee projects 2016,ie...
Pricing the cloud ieee projects, ieee projects chennai, ieee projects 2016,ie...Pricing the cloud ieee projects, ieee projects chennai, ieee projects 2016,ie...
Pricing the cloud ieee projects, ieee projects chennai, ieee projects 2016,ie...
 
Protection of big data privacy
Protection of big data privacyProtection of big data privacy
Protection of big data privacy
 
Power optimization with bler constraint for wireless fronthauls in c ran
Power optimization with bler constraint for wireless fronthauls in c ranPower optimization with bler constraint for wireless fronthauls in c ran
Power optimization with bler constraint for wireless fronthauls in c ran
 
Performance aware cloud resource allocation via fitness-enabled auction
Performance aware cloud resource allocation via fitness-enabled auctionPerformance aware cloud resource allocation via fitness-enabled auction
Performance aware cloud resource allocation via fitness-enabled auction
 
Performance limitations of a text search application running in cloud instances
Performance limitations of a text search application running in cloud instancesPerformance limitations of a text search application running in cloud instances
Performance limitations of a text search application running in cloud instances
 
Performance analysis and optimal cooperative cluster size for randomly distri...
Performance analysis and optimal cooperative cluster size for randomly distri...Performance analysis and optimal cooperative cluster size for randomly distri...
Performance analysis and optimal cooperative cluster size for randomly distri...
 
Predictive control for energy aware consolidation in cloud datacenters
Predictive control for energy aware consolidation in cloud datacentersPredictive control for energy aware consolidation in cloud datacenters
Predictive control for energy aware consolidation in cloud datacenters
 

Distance aware join for indoor moving objects

  • 1. Distance-Aware Join for Indoor Moving Objects Abstract: Indoor spaces accommodate large parts of people’s lives. Relevant techniques are thus needed to efficiently manage indoor moving objects, whose positions are detected by technologies, such as Assisted GPS, Wi-Fi, RFID, and Bluetooth. Among such techniques, the distance-aware join processing is of importance in practice for indoor spatial databases. Such join operators leverage a series of applications, such as indoor mobile service and facility monitoring. However, distance-aware joining over indoor moving objects is challenging because: (1) indoor spaces are characterized by many special entities and thus render distance calculation very complex; (2) the limitations of indoor positioning technologies create inherent uncertainties in indoor moving objects data. In this paper, we study two representative join predicates in indoor settings, semi-range join and semi-neighborhood join. To implement them, we define and categorize the indoor distances between indoor uncertain objects, and derive different distance bounds that can facilitate the join processing. We design a composite index scheme that integrates indoor geometries, indoor topologies, as well as indoor uncertain objects, and thus supports the join processing efficiently. The results of extensive experimental studies
  • 2. demonstrate that our proposals are efficient and scalable in evaluating distance-aware join over indoor moving objects. Existing System: In the emerging indoor applications, distance-aware joins constitute a series of expressive operators that are indispensable for indoor spatial data management. First of all, indoor spaces are characterized by entities such as walls, doors, rooms, etc., which render euclidean distance and spatial network distance unsuitable. Proposed System: First, we define the indoor distance between two moving objects Q and O, whose locations are obtained through the aforementioned limited indoor positioning. We choose the expected distance as it is both interpretative and semantically comprehensive. By referring to the indoor topology, we divide O’s imprecise location into disjoint subregions each falling into one indoor partition (e.g., a room). Subsequently, we classify the distances from Q and the subregions based on the topological properties, and derive various distance bounds that can remove non-qualifying join pairs without calculating detailed expected indoor distances.
  • 3. Hardware Requirements: • System : Pentium IV 2.4 GHz. • Hard Disk : 40 GB. • Floppy Drive : 1.44 Mb. • Monitor : 15 VGA Colour. • Mouse : Logitech. • RAM : 256 Mb. Software Requirements: • Operating system : - Windows XP. • Front End : - JSP • Back End : - SQL Server Software Requirements: • Operating system : - Windows XP. • Front End : - .Net • Back End : - SQL Server