发布求助
文献互助 智能选刊 最新文献

22nd International Conference on Data Engineering Workshops (ICDEW'06)最新文献

筛选
英文 中文
Web Search Improvement Based on Proximity and Density of Miltiple Keywords 基于多关键词接近度和密度的Web搜索改进
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.164
Chi Tian, Taro Tezuka, S. Oyama, Keishi Tajima, Katsumi Tanaka
{"title":"Web Search Improvement Based on Proximity and Density of Miltiple Keywords","authors":"Chi Tian, Taro Tezuka, S. Oyama, Keishi Tajima, Katsumi Tanaka","doi":"10.1109/ICDEW.2006.164","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.164","url":null,"abstract":"This paper proposes a method to improve the precison of Web retrieval based on proximity and density of keywords for two-keyword queries. In addition, filtering keywords by semantic relationships also be used. We have implemented a system that re-ranks Web search results based on three measures: first-appearance term distance, minimum term distance, and local appearance density. Furthermore, the system enables the user to assign weights to the new rank and original ranks so that the result can be presented in order of the combined rank. We built a prototype user interface in which the user can dynamically change the weights on two different ranks. The result of the experiment showed that our method improves the precision of Web search results for two-keyword queries.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117053009","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}
引用次数: 5
Investigating the Effect of Multiple Communities on Kernel-Based Citation Analysis 多群落对基于核的引文分析的影响研究
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.70
Takahiko Ito, M. Shimbo, D. Mochihashi, Yuji Matsumoto
{"title":"Investigating the Effect of Multiple Communities on Kernel-Based Citation Analysis","authors":"Takahiko Ito, M. Shimbo, D. Mochihashi, Yuji Matsumoto","doi":"10.1109/ICDEW.2006.70","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.70","url":null,"abstract":"In this paper, we discuss issues raised by applying Kandola et al.'s Neumann kernels to large citation graphs that have multiple communities. Neumann kernels can identify not only documents related a given document but also the most important documents in a citation graph. However, when Neumann kernels are biased towards importance, topranked documents are uniformly documents in the dominant community of the citation graph irrespective of the communities where the target document is cited. To solve this problem, we model a generation process of citations by probabilistic Latent Semantic Indexing, and then construct a weighted graph (hidden topic graph) for each community (topic). Applying Neumann kernels to each hidden topic graph, we can rank documents on the basis of the communities in which they appear.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132967427","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}
引用次数: 0
Trusted CVS 值得信赖的CVS
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.155
Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David J. Martin, J. Gehrke
{"title":"Trusted CVS","authors":"Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David J. Martin, J. Gehrke","doi":"10.1109/ICDEW.2006.155","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.155","url":null,"abstract":"The CVS (Concurrent Versions System) software is a popular method for recording modifications to data objects, in addition to concurrent access to data in a multi-user environment. In current implementations, all users have to trust that the CVS server performs all user operations as instructed. In this paper, we develop protocols that allow users to verify that the server has been compromised, and that it has performed exactly the users’ operations on the data. We first show that communication between users is necessary to guarantee that users can detect that the server has been compromised. We then propose efficient protocols that fast enable detection of server integrity under CVS workloads. Our techniques also have applications in the outsourcing model where multiple users own a common database maintained by an untrusted third-party vendor.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131669840","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
Flexibly Resizable Multidimensional Arrays 灵活调整大小的多维数组
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.62
Masakazu Kumakiri, Li Bei, T. Tsuji, K. Higuchi
{"title":"Flexibly Resizable Multidimensional Arrays","authors":"Masakazu Kumakiri, Li Bei, T. Tsuji, K. Higuchi","doi":"10.1109/ICDEW.2006.62","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.62","url":null,"abstract":"Recently, multidimensional arrays are becoming important data structures for storing large scale multidimensional data; e.g., in scientific databases or MOLAP databases. Size of multidimensional arrays used in such a database is fixed in every dimension in order to be benefited by the fast random accessing capability to array elements. While such a fixed size array cannot extend or shrink without relocating all of the elements, an extendible array can extend its size along any directions without any relocation. However that the existing extendible arrays can always extend only at the surrounding is a strict restriction. In this paper, we propose a new flexible extendible array organization, in which a subarray can be inserted or removed even in the midst of the array","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123194562","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}
引用次数: 5
Optimization of Complex Nested Queries in Relational Databases 关系数据库中复杂嵌套查询的优化
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.106
Bin Cao
{"title":"Optimization of Complex Nested Queries in Relational Databases","authors":"Bin Cao","doi":"10.1109/ICDEW.2006.106","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.106","url":null,"abstract":"Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performance. In this dissertation, we study two kinds of such queries: one is queries having non-aggregate subqueries and the other is queries having redundancy. To deal uniformly with non-aggregate subqueries in SQL, we propose the nested relational approach based on the nested relational model. To deal with redundancy in complex SQL queries, we propose the redundancy awareness method with the introduction of the for-loop operator. The main contribution of this dissertation is to provide more efficient solutions for these two kinds of queries than existing techniques.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122318897","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}
引用次数: 3
Semi-Automated Extraction of Targeted Data fromWeb Pages 从网页中半自动提取目标数据
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.135
Fabrice Estiévenart, Jean-Roch Meurisse, Jean-Luc Hainaut, Philippe Thiran
{"title":"Semi-Automated Extraction of Targeted Data fromWeb Pages","authors":"Fabrice Estiévenart, Jean-Roch Meurisse, Jean-Luc Hainaut, Philippe Thiran","doi":"10.1109/ICDEW.2006.135","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.135","url":null,"abstract":"TheWorldWideWeb can be considered an infinite source of information for both individuals and organizations. Yet, if the main standard of publication on the Web (HTML) is quite suited to human reading, its poor semantics makes it difficult for computers to process and use embedded data in a smart and automated way. In this paper, we propose to build a bridge between HTML documents and external applications by means of socalled mapping rules. Such rules mainly record a semantic interpretation of recurring types of information in a cluster of similar Web documents and their location in those documents. Relying on these rules, HTML-embedded data can be extracted towards a more computable format. The definition of mapping rules is based on direct user input mainly for the interpretation part, and on automatic computing for the location of data in HTML tree structures. This approach is supported by a user-friendly tool called Retrozilla.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131469659","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}
引用次数: 3
Query Rewriting in the Semantic Web7 语义Web7中的查询重写
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.124
Maria-Esther Vidal, L. Raschid, Natalia Marquez, M. Cardenas, Yao Wu
{"title":"Query Rewriting in the Semantic Web7","authors":"Maria-Esther Vidal, L. Raschid, Natalia Marquez, M. Cardenas, Yao Wu","doi":"10.1109/ICDEW.2006.124","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.124","url":null,"abstract":"The widespread explosion of Web accessible resources has lead to a new challenge of locating all relevant resources and identifying the best ones to answer a query. This challenge has to address the difficult task of ranking the resources based on user needs, as well as the more expensive computational task of determining all the solutions to answer a query. In this paper, we define a Top K problem for query rewriting on the Semantic Web. We first introduce a three level data model composed of the ontology level, the physical level of the physical resources, and the data level composed of the entries in the different resources. We present a query language for Top K navigational queries over ontology concepts. We then sketch the outline of an efficient search algorithm to compute an approximation of the Top K rewriting options to produce source paths among the physical resources. We briefly discuss the results of an experimental study","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127014815","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}
引用次数: 15
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems 非穷举模式匹配系统的有效性边界
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.51
M. Smiljanic, M. V. Keulen, W. Jonker
{"title":"Effectiveness Bounds for Non-Exhaustive Schema Matching Systems","authors":"M. Smiljanic, M. V. Keulen, W. Jonker","doi":"10.1109/ICDEW.2006.51","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.51","url":null,"abstract":"Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human effort required for validation quickly becomes huge in large scale environments. The performance of a matching system, however, is not solely determined by the quality of the mappings, but also by the efficiency with which it can produce them. Improving efficiency quickly leads to a trade-off between efficiency and effectiveness. Establishing or obtaining a large test collection for measuring this trade-off is often a severe obstacle. In this paper, we present a technique for determining lower and upper bounds for effectiveness measures for a certain class of schema matching system improvements in order to lower the required validation effort. Effectiveness bounds for a matching system improvement are solely derived from a comparison of answer sets of the improved and original matching system. The technique was developed in the context of improving efficiency in XML schema matching, but we believe it to be more generically applicable in other retrieval systems facing scalability problems.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133893441","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
AHPA-Calculating Hub and Authority for Information Retrieval ahpa -信息检索的计算中心和权限
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.26
G. Stephanides, M. Cosulschi, M. Gabroveanu, N. Constantinescu
{"title":"AHPA-Calculating Hub and Authority for Information Retrieval","authors":"G. Stephanides, M. Cosulschi, M. Gabroveanu, N. Constantinescu","doi":"10.1109/ICDEW.2006.26","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.26","url":null,"abstract":"The fast development of the World Wide Web makes searching and retrieving of information to become a not easy task. Two algorithms proposed around the fall of 1996, Page Rank [3] and HITS [9], became the center of majority research efforts. They try to remedy the abundance of results, bringing order with the help of notions related to prestige in social network analysis. Some approaches use the link structure of the web to find the importance of the web pages (Page Rank method [3]) or to determine their authority related to a particular topic (Hub and Authority concept). In this paper we propose a new method for calculating the authority of a web page.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115912537","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
An Integrated System Supporting Effective Indexing, Browsing and Retrieval of Microsoft Powerpoint Presentation Database 支持Microsoft Powerpoint演示文稿数据库有效索引、浏览和检索的集成系统
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.28
Cheng-Yao Chen
{"title":"An Integrated System Supporting Effective Indexing, Browsing and Retrieval of Microsoft Powerpoint Presentation Database","authors":"Cheng-Yao Chen","doi":"10.1109/ICDEW.2006.28","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.28","url":null,"abstract":"In this paper, we present an integrated system supporting effective indexing, browsing, and retrieval of Microsoft PowerPoint presentation databases. Our main achievement is that we provide an efficient representation that is automatically generated from semantic multimedia content analysis of presentation slides. We also improve the effectiveness of our poster representations of presentation slides and in turn enhance the performance of document understanding. Moreover, we help users with no or less domain knowledge locate presentations within a large database by our summarized presentation posters and information/document centric search algorithm. Finally, we comprehensively analyze the performance of our system with both quantitative comparisons and qualitative survey.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115253102","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信