17th International Workshop on Database and Expert Systems Applications (DEXA'06)最新文献_第2页

Automating Change Detection and Notification of Web Pages (Invited Paper) 网页的自动变更检测和通知(特邀论文)

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.34

Sharma Chakravarthy, Subramanian C. Hari Hara

引用次数: 22

Learning Term Spaces Based on Visual Feedback 基于视觉反馈的术语空间学习

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.82

M. Granitzer, T. Neidhart, M. Lux

{"title":"Learning Term Spaces Based on Visual Feedback","authors":"M. Granitzer, T. Neidhart, M. Lux","doi":"10.1109/DEXA.2006.82","DOIUrl":"https://doi.org/10.1109/DEXA.2006.82","url":null,"abstract":"Extracting and visualizing concepts and relationship between text documents strongly depends on the used similarity measure. In order to provide meaningful visualizations and to extract useful knowledge from document collections, user needs must be captured by the internal representation of documents, and the used similarity measure. In most applications the vector space model and the cosine similarity are used therefore and serve as good approximations. Nevertheless, influencing similarities between documents is rather hard, since parameter tuning relies heavily on expert knowledge of the underlying algorithms, and the influence of different weighting schemes and similarity measures is not known before. In this paper we present an approach on how to adapt the vector space representation of documents by giving visual feedback to the system. Our approach starts by clustering a corpus of text documents and visualizing the results using multi dimensional scaling techniques. Afterwards, a 2D landscape visualization is shown which can be manipulated by the user. Based on these manipulations the high dimensional representation of the documents is adapted to fit the users need more precisely. Our experiments show that iterating these steps results in an adapted representation of documents and similarities, generating layouts as intended by the user and furthermore increases clustering accuracy. While this paper only investigates the influence on clustering and visualization, the method itself may also be used for increasing classification and retrieval performance since it adapts to the users need of similarity","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133626558","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}

引用次数: 2

The PENG System: Practice and Experience 彭系统:实践与经验

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.136

G. Pasi, Gloria Bordogna, R. Villa

引用次数: 3

Bipolar Queries and Queries with Preferences (Invited Paper) 双极查询与偏好查询(特邀论文)

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.36

S. Zadrożny, J. Kacprzyk

引用次数: 35

String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures 基于代数签名的可扩展分布式数据结构中的字符串匹配和更新

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.132

R. Mokadem, W. Litwin

{"title":"String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures","authors":"R. Mokadem, W. Litwin","doi":"10.1109/DEXA.2006.132","DOIUrl":"https://doi.org/10.1109/DEXA.2006.132","url":null,"abstract":"Scalable distributed data structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applications. The prototype system was designed by CERIA, experiments with this technology for Wintel multicomputers. The application may manipulate data much faster than on local disks. We present the functions we have put into the prototype we now call SDDS-2004. We improve the searches and updates of records in our SDDS files. An original property of these functions is the use of the algebraic signatures. This technique serves the distributed non-key record search. The search may concern the entire field or a (sub)string. The algebraic properties of the signatures act similarly to hash schemes in the work of R.M. Karp and M.O. Rabin (1987). In particular, sending a few-byte signature of the searched string alone, suffices for the search. This makes the communication between the SDDS client and server more efficient. It is also more confidential, since the signature in an intercepted message does not disclose the searched string. On the other hand, we use the signatures for the update management. The clients do not need to then to send updates which in fact do not change the stored records. Finally, our signatures help managing the concurrency control. We present our architecture and design choices. Performance measures validate our implementation. It is now available for download in site of CERIA","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131400984","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}

引用次数: 7

An Efficient ZHLS Routing Protocol for Mobile Ad Hoc Networks 移动Ad Hoc网络中一种高效的ZHLS路由协议

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.24

Takashi Hamma, T. Katoh, B. B. Bista, T. Takata

引用次数: 32

Optimising Query Answering in the Presence of Access Limitations (Position Paper) 在存在访问限制的情况下优化查询应答(意见书)

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.109

A. Calí, Diego Calvanese

{"title":"Optimising Query Answering in the Presence of Access Limitations (Position Paper)","authors":"A. Calí, Diego Calvanese","doi":"10.1109/DEXA.2006.109","DOIUrl":"https://doi.org/10.1109/DEXA.2006.109","url":null,"abstract":"Relational data may have access limitations, i.e., relations may require certain attributes to be selected when they are accessed; this happens, for instance, while querying Web data sources (wrapped in relational form) or legacy databases. It is known that the evaluation of a conjunctive query under access limitations requires a recursive algorithm that is encoded into a Datalog program. In this paper we consider the problem of optimising query answering in this setting, where the query language is that of conjunctive queries. We review some optimisation techniques for this problem, that aim to reduce the number of accesses to the data in the query plan. Then we argue that checking query containment is necessary in this case for achieving effective query optimisation. Checking containment in the presence of access limitations would amount to check containment of recursive DATALOG programs, which is undecidable in general. We show however that, due to the specific form of the DATALOG programs resulting from encoding access limitations, the containment problem is indeed decidable. We present a decision procedure, first presented in a paper by the authors and based on chase techniques, and we analyse its computational complexity","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124763376","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}

引用次数: 4

MetaOn - Ontology Driven Metadata Construction and Management for Intelligent Search in Text and Image Collections meta -本体驱动的元数据构建和管理，用于文本和图像集合的智能搜索

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.95

H. Karanikas, N. Pelekis, Dimitrios K. Iakovidis, Ioannis Kopanakis, T. Mavroudakis, Y. Theodoridis

引用次数: 1

Agent-Based Petroleum Offshore Monitoring Using Sensor Networks 基于agent的海洋石油传感器网络监测

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.22

S. Hussain, Md. Rafiqul Islam, E. Shakshuki, M. Zaman

引用次数: 4

ClustDB: A High-Performance Tool for Large Scale Sequence Matching clusterdb:一个高性能的大规模序列匹配工具

17th International Workshop on Database and Expert Systems Applications (DEXA'06) Pub Date : 2006-09-04 DOI: 10.1109/DEXA.2006.40

J. Kleffe, Friedrich Möller, B. Wittig

引用次数: 6