Pub Date : 2012-08-31DOI: 10.5121/IJCSES.2012.3405
N. Chaurasia, Mradul Dhakar, Akhilesh Tiwari, R. K. Gupta
Along with the modernization and widespread usage of Internet, the security of the mankind has become one of the major issues today. The threat of human society from the terrorists is the challenge faced dominantly. Advancement in the technology has not only helped the common people for the growth but also these inhuman people to adversely affect the society with sophisticated techniques. In this regard, the law-enforcement agencies are aiming to prevent future attacks. To do so, the terrorist networks are being analyzed and detected. To achieve this, the law enforcement agencies are using data mining techniques as one of the effective solution. One such technique of data mining is Social network analysis which studies terrorist networks for the identification of relationships and associations that may exist between terrorist nodes. Terrorist activities can also be detected by means of analyzing Web traffic content. This paper studies social network analysis, web traffic content and explores various ways for identifying terrorist activities.
{"title":"A Survey on Terrorist Network Mining: Current Trends and Opportunities","authors":"N. Chaurasia, Mradul Dhakar, Akhilesh Tiwari, R. K. Gupta","doi":"10.5121/IJCSES.2012.3405","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3405","url":null,"abstract":"Along with the modernization and widespread usage of Internet, the security of the mankind has become one of the major issues today. The threat of human society from the terrorists is the challenge faced dominantly. Advancement in the technology has not only helped the common people for the growth but also these inhuman people to adversely affect the society with sophisticated techniques. In this regard, the law-enforcement agencies are aiming to prevent future attacks. To do so, the terrorist networks are being analyzed and detected. To achieve this, the law enforcement agencies are using data mining techniques as one of the effective solution. One such technique of data mining is Social network analysis which studies terrorist networks for the identification of relationships and associations that may exist between terrorist nodes. Terrorist activities can also be detected by means of analyzing Web traffic content. This paper studies social network analysis, web traffic content and explores various ways for identifying terrorist activities.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117088715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-30DOI: 10.5121/IJCSES.2012.3305
R. Mahapatra, Subia Khan
SQL injection has become a predominant type of attacks that target web applications. It allows attackers to obtain unauthorized access to the back-end database to change the intended application-generated SQL queries. Researchers have proposed various solutions to address SQL injection problems. However, many of them have limitations and often cannot address all kinds of injection problems. What’s more, new types of SQL injection attacks have arisen over the years. To better counter these attacks, identifying and understanding existing countermeasures are very important. In this research , I had surveyed existing techniques against SQL injection attacks and analyzed their advantages and disadvantages. In addition, I identified techniques for building secure systems and applied them to my applications and database system, and illustrated how they were performed and the effect of them.
{"title":"A Survey Of Sql Injection Countermeasures","authors":"R. Mahapatra, Subia Khan","doi":"10.5121/IJCSES.2012.3305","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3305","url":null,"abstract":"SQL injection has become a predominant type of attacks that target web applications. It allows attackers to obtain unauthorized access to the back-end database to change the intended application-generated SQL queries. Researchers have proposed various solutions to address SQL injection problems. However, many of them have limitations and often cannot address all kinds of injection problems. What’s more, new types of SQL injection attacks have arisen over the years. To better counter these attacks, identifying and understanding existing countermeasures are very important. In this research , I had surveyed existing techniques against SQL injection attacks and analyzed their advantages and disadvantages. In addition, I identified techniques for building secure systems and applied them to my applications and database system, and illustrated how they were performed and the effect of them.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116627474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-30DOI: 10.5121/IJCSES.2012.3302
Santhosha Rao, K. Shama
Wireless networks initially inherited the traditional layered architecture from wired networks. Nevertheless, as third and fourth generation wireless communications and networking begin to proliferate in the area of communication networks, the suitability of the layered architecture is coming under close scrutiny from the research community. It is repeatedly argued that although layered architectures have served well for wired networks, they might not be suitable for wireless networks [1]. One of the key challenges for next-generation broadband wireless networks is to devise end-to-end protocol solutions across wired and wireless networks to accommodate large densities of highly mobile users demanding services and applications with a wide range of Quality of Service (QoS) requirements. Hence, in order to meet the challenging demands on future wireless networks, it may be required to adopt new approaches in which protocols can be designed by violating the reference layered architecture allowing direct communication between protocols in nonadjacent layers Such violations of a layered architecture have been termed as cross-layer design(CLD).
{"title":"CROSS LAYER PROTOCOLS FOR MULTIMEDIA TRANSMISSION IN WIRELESS NETWORKS","authors":"Santhosha Rao, K. Shama","doi":"10.5121/IJCSES.2012.3302","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3302","url":null,"abstract":"Wireless networks initially inherited the traditional layered architecture from wired networks. Nevertheless, as third and fourth generation wireless communications and networking begin to proliferate in the area of communication networks, the suitability of the layered architecture is coming under close scrutiny from the research community. It is repeatedly argued that although layered architectures have served well for wired networks, they might not be suitable for wireless networks [1]. \u0000One of the key challenges for next-generation broadband wireless networks is to devise end-to-end protocol solutions across wired and wireless networks to accommodate large densities of highly mobile users demanding services and applications with a wide range of Quality of Service (QoS) requirements. Hence, in order to meet the challenging demands on future wireless networks, it may be required to \u0000adopt new approaches in which protocols can be designed by violating the reference layered architecture allowing direct communication between protocols in nonadjacent layers Such violations of a layered architecture have been termed as cross-layer design(CLD).","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127298119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-30DOI: 10.5121/IJCSES.2012.3303
S. Vaidyanathan
This paper deploys active control for achieving complete synchronization of hyperchaotic Xu (2009) and hyperchaotic Lu (2006) systems. Specifically, this paper derives complete synchronization results for identical hyperchaotic Xu systems, identical hyperchaotic Lu systems and non-identical hyperchaotic Xu and Lu systems. The complete synchronization results have been proved using Lyapunov stability theory. Numerical simulations have been shown to validate and demonstrate the effectiveness of the complete synchronization results derived in this paper.
{"title":"COMPLETE SYNCHRONIZATION OF HYPERCHAOTIC XU AND HYPERCHAOTIC LÜ SYSTEMS VIA ACTIVE CONTROL","authors":"S. Vaidyanathan","doi":"10.5121/IJCSES.2012.3303","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3303","url":null,"abstract":"This paper deploys active control for achieving complete synchronization of hyperchaotic Xu (2009) and hyperchaotic Lu (2006) systems. Specifically, this paper derives complete synchronization results for identical hyperchaotic Xu systems, identical hyperchaotic Lu systems and non-identical hyperchaotic Xu and Lu systems. The complete synchronization results have been proved using Lyapunov stability theory. Numerical simulations have been shown to validate and demonstrate the effectiveness of the complete synchronization results derived in this paper.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133595639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-30DOI: 10.5121/IJCSES.2012.3304
Nebu Varghese, V. Verghese, N. Jaisankar, Tech Student
Dimensionality Reduction is usually achieved on the feature space by adopting any one of the prescribed methods that fall under the selected technique. Feature selection and Feature extraction being the two aforesaid techniques of reducing dimensionality, the former discards certain features that may be useful at a later stage whereas the latter re-constructs its features into a simpler dimension thereby preserving all its initial characteristics. The sole purpose of this survey is to provide an adequate comprehension of the different dimensionality reduction techniques that exist currently and also to introduce the applicability of any one of the prescribed methods depending upon the given set of parameters and varying conditions as described, under each algorithm’s usage statistics. This paper also presents guidelines where in, selection of the best possible algorithm for a specific instance can be determined with ease when a condition arises where in two or more algorithms may be suitable for executing the aforementioned task.
{"title":"A SURVEY OF DIMENSIONALITY REDUCTION AND CLASSIFICATION METHODS","authors":"Nebu Varghese, V. Verghese, N. Jaisankar, Tech Student","doi":"10.5121/IJCSES.2012.3304","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3304","url":null,"abstract":"Dimensionality Reduction is usually achieved on the feature space by adopting any one of the prescribed methods that fall under the selected technique. Feature selection and Feature extraction being the two aforesaid techniques of reducing dimensionality, the former discards certain features that may be useful at a later stage whereas the latter re-constructs its features into a simpler dimension thereby preserving all its initial characteristics. The sole purpose of this survey is to provide an adequate comprehension of the different dimensionality reduction techniques that exist currently and also to introduce the applicability of any one of the prescribed methods depending upon the given set of parameters and varying conditions as described, under each algorithm’s usage statistics. This paper also presents guidelines where in, selection of the best possible algorithm for a specific instance can be determined with ease when a condition arises where in two or more algorithms may be suitable for executing the aforementioned task.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121837080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-06-30DOI: 10.5121/IJCSES.2012.3301
Delan Alsoufi, K. Elleithy, Tariq Abuzaghleh, Ahmad Nassar
Wireless sensor networks are becoming significantly vital to many applications, and they were initially used by the military for surveillance purposes. One of the biggest concerns of WSNs is that they are very defenceless to security threats. Due to the fact that these networks are susceptible to hackers; it is possible for one to enter and render a network. For example, such networks may be hacked into in the military, using the system to attack friendly forces. Leap protocol offers many security benefits to WSNs. However, with much research it became apparent that LEAP only employs one base station and always assumes that it is trustworthy. It does not consist of defence against hacked or compromised base stations. In this paper, intensive research was undertaken on LEAP protocols, finding out its security drawbacks and limitations. A solution has been proposed in order to overcome the security issues faced in implementing this protocol whilst employing more than one base station. The performance of the proposed solution has been evaluated and simulated to provide a better network performance.
{"title":"SECURITY IN WIRELESS SENSOR NETWORKS - IMPROVING THE LEAP PROTOCOL","authors":"Delan Alsoufi, K. Elleithy, Tariq Abuzaghleh, Ahmad Nassar","doi":"10.5121/IJCSES.2012.3301","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3301","url":null,"abstract":"Wireless sensor networks are becoming significantly vital to many applications, and they were initially used by the military for surveillance purposes. One of the biggest concerns of WSNs is that they are very defenceless to security threats. Due to the fact that these networks are susceptible to hackers; it is possible for one to enter and render a network. For example, such networks may be hacked into in the military, using the system to attack friendly forces. Leap protocol offers many security benefits to WSNs. However, with much research it became apparent that LEAP only employs one base station and always assumes that it is trustworthy. It does not consist of defence against hacked or compromised base stations. In this paper, intensive research was undertaken on LEAP protocols, finding out its security drawbacks and limitations. A solution has been proposed in order to overcome the security issues faced in implementing this protocol whilst employing more than one base station. The performance of the proposed solution has been evaluated and simulated to provide a better network performance.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134328471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fingerprint analysis plays a crucial role in crucial legal matters such as investigation of crime and security system. Due to the large number and size of fingerprint images, data compression has to be applied to reduce the storage and communication bandwidth requirements of those images. To do this, there are many types of wavelet has been used for fingerprint image compression. In this paper we have used Coiflet-Type wavelets and our aim is to determine the most appropriate Coiflet-Type wavelet for better compression of a digitized fingerprint image and to achieve our goal Retain Energy (RE) and Number of Zeros (NZ) in percentage is determined for different Coiflet-Type wavelets at different threshold values at the fixed decomposition level 3 using wavelet and wavelet packet transform. We have used 8-bit grayscale left thumb digitized fingerprint image of size 480×400 as a test image.
{"title":"Performance analysis of Coiflet-type wavelets for a fingerprint image compression by using wavelet and wavelet packet transform","authors":"Rafiqul Islam, Farhad Bulbul, Shewli Shamim Shanta","doi":"10.5121/IJCSES.2012.3209","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3209","url":null,"abstract":"Fingerprint analysis plays a crucial role in crucial legal matters such as investigation of crime and security system. Due to the large number and size of fingerprint images, data compression has to be applied to reduce the storage and communication bandwidth requirements of those images. To do this, there are many types of wavelet has been used for fingerprint image compression. In this paper we have used Coiflet-Type wavelets and our aim is to determine the most appropriate Coiflet-Type wavelet for better compression of a digitized fingerprint image and to achieve our goal Retain Energy (RE) and Number of Zeros (NZ) in percentage is determined for different Coiflet-Type wavelets at different threshold values at the fixed decomposition level 3 using wavelet and wavelet packet transform. We have used 8-bit grayscale left thumb digitized fingerprint image of size 480×400 as a test image.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115852255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-04-30DOI: 10.5121/IJCSES.2012.3204
R. Bhatnagar, Udai Shankar
Data security is a huge responsibility for sensor network as there are various ways in which security can be breached, enabling hackers to access sensitive data. Threats to wireless sensor networks are numerous and potentially devastating. Security issues ranging from session hijacking to Denial of Service (DOS) can plague a WSN. To aid in the defense and detection of these potential threats, WSN employ a security solution that includes an intrusion detection system (IDS). Different neural methods have been proposed in recent years for the development of intrusion detection system. In this paper, we surveyed denial of service attacks that disseminate the WSN such a way that it temporarily paralyses a network and proposed a hybrid Intrusion Detection approach based on stream flow and session state transition analysis that monitor and analyze stream flow of data, identify abnormal network activity, detect policy violations against sync flood attack.
{"title":"THE PROPOSAL OF HYBRID INTRUSION DETECTION FOR DEFENCE OF SYNC FLOOD ATTACK IN WIRELESS SENSOR NETWORK","authors":"R. Bhatnagar, Udai Shankar","doi":"10.5121/IJCSES.2012.3204","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3204","url":null,"abstract":"Data security is a huge responsibility for sensor network as there are various ways in which security can be breached, enabling hackers to access sensitive data. Threats to wireless sensor networks are numerous and potentially devastating. Security issues ranging from session hijacking to Denial of Service (DOS) can plague a WSN. To aid in the defense and detection of these potential threats, WSN employ a security solution that includes an intrusion detection system (IDS). Different neural methods have been proposed in recent years for the development of intrusion detection system. In this paper, we surveyed denial of service attacks that disseminate the WSN such a way that it temporarily paralyses a network and proposed a hybrid Intrusion Detection approach based on stream flow and session state transition analysis that monitor and analyze stream flow of data, identify abnormal network activity, detect policy violations against sync flood attack.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125837970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-04-30DOI: 10.5121/IJCSES.2012.3207
Anand Joshi, A. Shaikh, Aruna Kadam, Vasudha Sahu
In order to allow users to access Internet services privately, anonymizing networks like Tor uses a series of routers to hide the client’s IP address from the server. These networks, however, have been marred by users employing this anonymity for abusive purposes such as defacing popular web sites. Usually, web site administrators rely on IP-address blocking in order to disable access to misbehaving users, but it is impractical if the abuser routes through an anonymizing network. In order to avoid this, administrators bar all known exit nodes of the anonymizing network, thereby denying anonymous access to all the users (whether misbehaving or not). To solve this issue, we introduce Nymble, a system where servers blacklist misbehaving users, thereby blocking users without affecting their anonymity. Nymble is thus agnostic to varied definitions of misbehavior. Servers can block users for any reason, and the privacy of blacklisted users is not affected in any case.
{"title":"NYMBLE BLOCKING SYSTEM","authors":"Anand Joshi, A. Shaikh, Aruna Kadam, Vasudha Sahu","doi":"10.5121/IJCSES.2012.3207","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3207","url":null,"abstract":"In order to allow users to access Internet services privately, anonymizing networks like Tor uses a series of routers to hide the client’s IP address from the server. These networks, however, have been marred by users employing this anonymity for abusive purposes such as defacing popular web sites. Usually, web site administrators rely on IP-address blocking in order to disable access to misbehaving users, but it is impractical if the abuser routes through an anonymizing network. In order to avoid this, administrators bar all known exit nodes of the anonymizing network, thereby denying anonymous access to all the users (whether misbehaving or not). To solve this issue, we introduce Nymble, a system where servers blacklist misbehaving users, thereby blocking users without affecting their anonymity. Nymble is thus agnostic to varied definitions of misbehavior. Servers can block users for any reason, and the privacy of blacklisted users is not affected in any case.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114168462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-04-30DOI: 10.5121/IJCSES.2012.3208
S. Sivasubramanian
Spatial database systems manage large collections of geographic entities, which apart from spatial attributes contain spatial information and non spatial information (e.g., name, size, type, price, etc.). An attractive type of preference queries, which select the best spatial location with respect to the quality of facilities in its spatial area. Given a set D of interesting objects (e.g., candidate locations), a top-k spatial preference query retrieves the k objects in D with the highest scores. The featured score of a given object is derived from the quality of features (e.g., location and nearby features) in its spatial neighborhood. For example, using a landed property agency database of flats for Sale, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, bus stop, hospital, market, school, etc.) within their spatial neighborhood. This neighborhood concept can be defined by different functions by the user. It can be an explicit circular region within a given distance from the flat. Another sensitive definition is to assign higher rates to the features based on their proximity to the land. In this paper, we formally define spatial preference queries and propose suitable dynamic index techniques and searching algorithms for them. We extend [1] results with dynamic index structure in order to accommodate time - variant changes in the spatial data. In my current work is the top-k spatial preference query on road network, in which the distance between object and road is defined by their shortest path distance.
{"title":"INCLUSION OF ROAD NETWORK IN THE SPATIAL DATABASE FOR FEATURES SEARCHING USING DYNAMIC INDEX","authors":"S. Sivasubramanian","doi":"10.5121/IJCSES.2012.3208","DOIUrl":"https://doi.org/10.5121/IJCSES.2012.3208","url":null,"abstract":"Spatial database systems manage large collections of geographic entities, which apart from spatial attributes contain spatial information and non spatial information (e.g., name, size, type, price, etc.). An attractive type of preference queries, which select the best spatial location with respect to the quality of facilities in its spatial area. Given a set D of interesting objects (e.g., candidate locations), a top-k spatial preference query retrieves the k objects in D with the highest scores. The featured score of a given object is derived from the quality of features (e.g., location and nearby features) in its spatial neighborhood. For example, using a landed property agency database of flats for Sale, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, bus stop, hospital, market, school, etc.) within their spatial neighborhood. This neighborhood concept can be defined by different functions by the user. It can be an explicit circular region within a given distance from the flat. Another sensitive definition is to assign higher rates to the features based on their proximity to the land. In this paper, we formally define spatial preference queries and propose suitable dynamic index techniques and searching algorithms for them. We extend [1] results with dynamic index structure in order to accommodate time - variant changes in the spatial data. In my current work is the top-k spatial preference query on road network, in which the distance between object and road is defined by their shortest path distance.","PeriodicalId":415526,"journal":{"name":"International Journal of Computer Science & Engineering Survey","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127699124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：