Pub Date : 1900-01-01DOI: 10.1109/SCCC.2002.1173189
S. da Silva Camargo, P. Martins Engel
Mining a sales transaction database is a very expensive task in terms of the processing time. Depending on the business branch of the company some characteristics of the database are different. The algorithms currently used for mining association rules optimize this task for databases with supermarket characteristics. The MiRABIT algorithm that is presented in this work optimizes the mining task for databases with clothing store characteristics. Comparative tests demonstrate the efficiency of the proposed algorithm in relation to the standard algorithm Apriori in a clothing store database.
{"title":"MiRABIT: A new algorithm for mining association rules","authors":"S. da Silva Camargo, P. Martins Engel","doi":"10.1109/SCCC.2002.1173189","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173189","url":null,"abstract":"Mining a sales transaction database is a very expensive task in terms of the processing time. Depending on the business branch of the company some characteristics of the database are different. The algorithms currently used for mining association rules optimize this task for databases with supermarket characteristics. The MiRABIT algorithm that is presented in this work optimizes the mining task for databases with clothing store characteristics. Comparative tests demonstrate the efficiency of the proposed algorithm in relation to the standard algorithm Apriori in a clothing store database.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114656658","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 : 1900-01-01DOI: 10.1109/SCCC.2002.1173178
C.J. Barenco Abbas, J. G. Villalba
QoS solutions for Core Internet Networks require that we pay special attention to scalability, as they deal with a lot of flows and demand many resources. In this paper, integrated solutions from the physical layer (SDH/SONET and DTM) to the IP layer (IntServ and DiffServ) are analysed and proposed, concentrating not only on scalability, but also on QoS guarantees.
{"title":"Scalable QoS approach in a core internet network","authors":"C.J. Barenco Abbas, J. G. Villalba","doi":"10.1109/SCCC.2002.1173178","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173178","url":null,"abstract":"QoS solutions for Core Internet Networks require that we pay special attention to scalability, as they deal with a lot of flows and demand many resources. In this paper, integrated solutions from the physical layer (SDH/SONET and DTM) to the IP layer (IntServ and DiffServ) are analysed and proposed, concentrating not only on scalability, but also on QoS guarantees.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115047317","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 : 1900-01-01DOI: 10.1109/SCCC.2002.1173190
R. do Nascimento Fidalgo, V. Cesario Times, F. da Fonseca de Souza
This paper presents OLAPWare and how to achieve OLAP interoperability with its use. OLAPWare is a Java middleware for providing OLAP Services compliant with the OLE DB for OLAP standard. OLE DB for OLAP is an industrial standard for allowing interoperability among OLAP tools. However, it is limited to the Windows/COM platform, even when a Java API is used. By using OLAPWare to overcome this limitation, Java clients are able to query the multidimensional data of any OLE DB for OLAP server independently from their implementation platforms.
{"title":"Providing OLAP interoperability with OLAPWare","authors":"R. do Nascimento Fidalgo, V. Cesario Times, F. da Fonseca de Souza","doi":"10.1109/SCCC.2002.1173190","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173190","url":null,"abstract":"This paper presents OLAPWare and how to achieve OLAP interoperability with its use. OLAPWare is a Java middleware for providing OLAP Services compliant with the OLE DB for OLAP standard. OLE DB for OLAP is an industrial standard for allowing interoperability among OLAP tools. However, it is limited to the Windows/COM platform, even when a Java API is used. By using OLAPWare to overcome this limitation, Java clients are able to query the multidimensional data of any OLE DB for OLAP server independently from their implementation platforms.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122601356","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 : 1900-01-01DOI: 10.1109/SCCC.2002.1173185
Artur Afonso de Sousa, J. Pereira, J. Carvalho
As new standards for technology specifications related to XML are unveiled, and stable tools to implement them become available, the widespread usage of XML as a universal format for data exchange between heterogeneous systems (using the Internet), will increasingly become a reality. Therefore, in order to deal efficiently with the large amounts of XML data that will be generated in the near future it is imperative to find efficient alternatives for the storage and management of this special kind of data. For that matter, object-oriented databases seem to be a good alternative. We begin with an analysis of the different alternatives available to store and manage XML data. After that, we concentrate our attention on the object-oriented (OO) database approach and, in that context, we present a first set of rules that allow the translation from a simple database schema specified in ODL (Object Definition Language) into a schema specified in XML-SCHEMA. In the near future we intend not only to expand this set with new rules that will handle other, more complex, OO modeling constructs, but also to create another set of transformation rules to work the other way round (i.e. from XML-SCHEMA to ODL). Our aim is to cover all the possible modeling situations one may come across in OO database schemas specified in ODL.
{"title":"Mapping rules to convert from ODL to XML-SCHEMA","authors":"Artur Afonso de Sousa, J. Pereira, J. Carvalho","doi":"10.1109/SCCC.2002.1173185","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173185","url":null,"abstract":"As new standards for technology specifications related to XML are unveiled, and stable tools to implement them become available, the widespread usage of XML as a universal format for data exchange between heterogeneous systems (using the Internet), will increasingly become a reality. Therefore, in order to deal efficiently with the large amounts of XML data that will be generated in the near future it is imperative to find efficient alternatives for the storage and management of this special kind of data. For that matter, object-oriented databases seem to be a good alternative. We begin with an analysis of the different alternatives available to store and manage XML data. After that, we concentrate our attention on the object-oriented (OO) database approach and, in that context, we present a first set of rules that allow the translation from a simple database schema specified in ODL (Object Definition Language) into a schema specified in XML-SCHEMA. In the near future we intend not only to expand this set with new rules that will handle other, more complex, OO modeling constructs, but also to create another set of transformation rules to work the other way round (i.e. from XML-SCHEMA to ODL). Our aim is to cover all the possible modeling situations one may come across in OO database schemas specified in ODL.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130561907","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 : 1900-01-01DOI: 10.1109/SCCC.2002.1173186
A. Afonso de Sousa, J. Luis Pereira, J. Alvaro Carvalho
The XML (eXtensible Mark-up Language), proposed by the W3C (World Wide Web Consortium) as the new standard for data representation and exchange in the Internet, is a document mark-up (meta) language that seems adequate to the needs of today's World Wide Web. With the proliferation of XML documents in the Web, it is necessary to store and query them efficiently. It is our purpose to investigate the different approaches currently available to the storage and management of XML data. Moreover, we intend to analyse the main characteristics of some of the XML query languages, which have been proposed both by the database and Internet communities, namely XML-QL, XQL, Quilt, and Xquery. The latter has been proposed by the W3C Query Working Group with the purpose of providing a standard for a XML query language. We believe that a query language such as Xquery will certainly accelerate the utilization of XML as an alternative approach to data storage, since it will make possible to interrogate, efficiently and in unpredictable ways (queries ad hoc), XML documents.
{"title":"Querying XML databases","authors":"A. Afonso de Sousa, J. Luis Pereira, J. Alvaro Carvalho","doi":"10.1109/SCCC.2002.1173186","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173186","url":null,"abstract":"The XML (eXtensible Mark-up Language), proposed by the W3C (World Wide Web Consortium) as the new standard for data representation and exchange in the Internet, is a document mark-up (meta) language that seems adequate to the needs of today's World Wide Web. With the proliferation of XML documents in the Web, it is necessary to store and query them efficiently. It is our purpose to investigate the different approaches currently available to the storage and management of XML data. Moreover, we intend to analyse the main characteristics of some of the XML query languages, which have been proposed both by the database and Internet communities, namely XML-QL, XQL, Quilt, and Xquery. The latter has been proposed by the W3C Query Working Group with the purpose of providing a standard for a XML query language. We believe that a query language such as Xquery will certainly accelerate the utilization of XML as an alternative approach to data storage, since it will make possible to interrogate, efficiently and in unpredictable ways (queries ad hoc), XML documents.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"29 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131111060","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 : 1900-01-01DOI: 10.1109/SCCC.2002.1173181
J. Lucio Maia, S. Donizetti Zorzo
Concomitantly to the extraordinary growth of the multimedia applications, a great development in the field of mobile communications took place, the union of these areas provided a whole new set of fascinating services to end-users. However, the multimedia traffic tends to emphasize the wireless network's limitations making it necessary for the development of applications that are able to adapt themselves to the network changes. This paper proposes a monitoring system for quality of service parameters in these networks, so that the applications can constantly verify the connection status and take adaptation measures if needed. The implemented monitor tries to be accurate and light because an increase in the network resource utilization only for monitoring purposes would account for an even heavier degradation in the quality provided to the user. After the presentation of a survey on the subject, the paper introduces the monitoring system, its usage and a case study evaluating its functionality.
{"title":"Socket-masking and SNMP: a hybrid approach for QoS monitoring in mobile computing environments","authors":"J. Lucio Maia, S. Donizetti Zorzo","doi":"10.1109/SCCC.2002.1173181","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173181","url":null,"abstract":"Concomitantly to the extraordinary growth of the multimedia applications, a great development in the field of mobile communications took place, the union of these areas provided a whole new set of fascinating services to end-users. However, the multimedia traffic tends to emphasize the wireless network's limitations making it necessary for the development of applications that are able to adapt themselves to the network changes. This paper proposes a monitoring system for quality of service parameters in these networks, so that the applications can constantly verify the connection status and take adaptation measures if needed. The implemented monitor tries to be accurate and light because an increase in the network resource utilization only for monitoring purposes would account for an even heavier degradation in the quality provided to the user. After the presentation of a survey on the subject, the paper introduces the monitoring system, its usage and a case study evaluating its functionality.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123682212","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 : 1900-01-01DOI: 10.1109/SCCC.2002.1173167
H. H. von Brand
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function front keys to buckets would give. This model gives surprisingly simple expressions for the mean value of some statistics on hash functions. It is also seen that the universal hash functions give the same distribution of keys, and so the results here are applicable to them too.
{"title":"On the distribution of keys by hashing","authors":"H. H. von Brand","doi":"10.1109/SCCC.2002.1173167","DOIUrl":"https://doi.org/10.1109/SCCC.2002.1173167","url":null,"abstract":"The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function front keys to buckets would give. This model gives surprisingly simple expressions for the mean value of some statistics on hash functions. It is also seen that the universal hash functions give the same distribution of keys, and so the results here are applicable to them too.","PeriodicalId":130951,"journal":{"name":"12th International Conference of the Chilean Computer Science Society, 2002. Proceedings.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127158153","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
扫码关注我们
求助内容：
应助结果提醒方式：