{"title":"Query planning in P2P database systems","authors":"K. Nørvåg, E. Eide, Odin Hole Standal","doi":"10.1109/ICDIM.2007.4444252","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444252","url":null,"abstract":"The peer-to-peer (P2P) paradigm is emerging as a possible solution to some of the problems in distributed data processing, including scalability, availability, and administrative cost. P2P has already proved to be suitable in contexts like file sharing, distributed computations, and distributed search. In our research we are aiming at using P2P to solve some problems in the domain of distributed databases. In this paper we 1) present PORDaS, a distributed DBMS based on P2P techniques, 2) describe query processing and query planning in PORDaS, and 3) present results from an experimental evaluation of different query planning variants.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124060884","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}
{"title":"Introduction of an MPEG-7 query language","authors":"M. Döller, Kerstin Renner, H. Kosch","doi":"10.1109/ICDIM.2007.4444206","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444206","url":null,"abstract":"Today the availability of digital media content is well established and widespread. Not only commercial content distribution is a big market, but also user driven digital multimedia content is produced and shared in big communities. One of the metadata standards that has been established to describe multimedia content via metadata is MPEG-7. This international standard facilitates many application domains and is probably the richest multimedia metadata set available today. However it does not yet exist a common query format that enables the user to query multimedia metadata databases. Therefore the MPEG committee decided to instantiate a call for proposal (N8220)for an MPEG-7 query format (MP7QF) framework and specified a set of requirements (N8219). This paper introduces a MP7QF query language and describes the background and requirements as well as the main architectural concepts and associated MP7QF XML schema types.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127415852","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}
{"title":"Solution architecture for detecting and preventing fraud in real time","authors":"S. Rozsnyai, Josef Schiefer, Alexander Schatten","doi":"10.1109/ICDIM.2007.4444216","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444216","url":null,"abstract":"Fraud has been an issue since the very beginnings of commerce. Today, as business moved into the online era, this topic has become a major issue in e-commerce. In this paper, we introduce a solution architecture for detection and preventing fraud in real time by using an event-based system called SARI (sense and respond infrastructure). We present the architecture and components for a real-time fraud management solution which can be easily adapted to the business needs of domain experts and business users. The SARI system provides functions to monitor customer behavior as well as it can steer and optimize customer processes in real time. For illustrating our approach, we show fraud scenarios of an online gambling service provider.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133757365","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}
{"title":"Reputation system for large scale environments","authors":"R. Špánek","doi":"10.1109/ICDIM.2007.4444294","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444294","url":null,"abstract":"The paper describes a new approach for treating trust in reconfigurable groups of users with special accent on trust in the next generations of the Internet. The proposed model uses properties of weighted hypergraphs. Model flexibility enables description of relations between nodes such that these relations are preserved under frequent changes. The ideas can be straightforwardly generalized to other concepts describable by weighted hypergraphs. The consistency of the proposal was verified in a couple of experiments with our pilot implementation SecGRID.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130380537","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}
{"title":"Guaranteeing integrity constraints during interactive map editing with visual language parsing","authors":"V. D. Fatto, V. Deufemia, L. Paolino","doi":"10.1109/ICDIM.2007.4444194","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444194","url":null,"abstract":"In this paper we propose an approach based on visual language parsing for guaranteeing the integrity of data produced during the editing process of maps. According to our approach, constraints are expressed by using high-level data model, such as OMT-G, and converted in a properly visual language grammar. From such a grammar, a parser able to identify incorrect aggregation of spatial data input is automatically generated. The grammar formalism also allows us to associate suitable semantic actions with productions in order to perform automatic corrections of inconsistent input data, error recognition and visualization, prompting actions for error recovery.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130731618","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}
{"title":"A secure collaborative web based environment for virtual organizations","authors":"R. Laborde, M. Kamel, F. Barrère, A. Benzekri","doi":"10.1109/ICDIM.2007.4444310","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444310","url":null,"abstract":"The concept of Virtual Organization (VO) is a natural outcome of networks evolution and collaborative work tools growth. In the projects VIVACE and TSCP, we have studied the different issues when setting VOs up. In this paper, we expose requirements and characteristics of VOs through a use case, which was proposed by these consortiums. Then, we present a secured collaborative environment, which combines attribute based access control models, privileges management infrastructure and federation of identity, we have deployed to deal with VO security constraints.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132131858","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}
{"title":"Device and service descriptions in Personal Distributed Environments","authors":"Suparna De, K. Moessner","doi":"10.1109/ICDIM.2007.4444305","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444305","url":null,"abstract":"The current research on context-aware systems in ubiquitous environments opens a number of interlinked research challenges. On the lowest level of such systems, discovery mechanisms and flexible semantic descriptions of available devices and services form the basis for end-user service personalization. The challenge is to design a description model that leverages implicit semantic information obtained, while being cognizant of resource constraints of a device. To encounter the different device characteristics and personalization challenges, this paper proposes a device and service description approach that provides a high level contextual view of device information. The work has been performed as part of the Personal Distributed Environment concept, also described in the paper. Further, a user-centric view of multiple user interface devices to access services in a heterogeneous and dynamic networked environment has been implemented by extending UPnP device discovery. A comparison with existing state of the art approaches concludes the work.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122583867","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}
{"title":"Building classifiers with association rules based on small key itemsets","authors":"V. Phan-Luong, Rabah Messouci","doi":"10.1109/ICDIM.2007.4444223","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444223","url":null,"abstract":"We present a simple method for building classifiers based on class-association rules. The method uses a prefix tree structure for mining the frequent itemsets and class- association rules extracted from a training dataset. The rules of a classifier are selected from those built on key item-sets with small sizes, having maximal confidences and maximal supports, and correctly classifying each object of the training dataset. The comparisons with some existing methods in classification, via the experimental results on large datasets, show that on average the present method is better in terms of accuracy and computational efficiency.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123897980","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}
{"title":"Vector maps compression for progressive transmission","authors":"Alexander Kolesnikov","doi":"10.1109/ICDIM.2007.4444204","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444204","url":null,"abstract":"Problem of progressive transmission of large vector maps from spatial information systems to clients by channels with narrow bandwidth is considered. At first, the simplified version of the vector map is sent to client and the client can manipulate with the data at the coarse resolution level and request finer version of the map. The proposed algorithm includes optimal multiresolution polygonal approximation with quantization and lossless compression of quantized data with arithmetic codes. Proposed approach demonstrated high compression performance with heuristic Douglas-Peucker and optimal minimal-bitrate algorithms.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116370692","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}
{"title":"A novel Bayesian Network structure learning algorithm based on minimal correlated itemset mining techniques","authors":"Zahra Kebaili, A. Aussem","doi":"10.1109/ICDIM.2007.4444211","DOIUrl":"https://doi.org/10.1109/ICDIM.2007.4444211","url":null,"abstract":"In this paper, we propose a new constraint-based method for Bayesian network structure learning based on correlated itemset mining techniques. The aim of this method is to identify and to represent conjunctions of Boolean factors implied in probabilistic dependence relationships, that may be ignored by constraint and scoring-based learning proposals when the pairwise dependencies are weak (e.g., noisy- XOR). The method is also able to identify some specific (almost) deterministic relationships in the data that cause the violation of the faithfulness assumption on which are based most constraint-based methods. The algorithm operates in two steps: (1) extraction of minimal supported and correlated itemsets, and (2), construction of the structure by extracting the most significant association rules in these itemsets. The method is illustrated on a simple but realistic benchmark plaguing the standard scoring and constraint- based algorithms.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116826740","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}