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

Very Large Data Bases Conference最新文献

筛选
英文 中文
Automating incremental graph processing with flexible memoization 自动化增量图形处理与灵活的记忆
Very Large Data Bases Conference Pub Date : 2021-05-01 DOI: 10.14778/3461535.3461550
GongShufeng, TianChao, Yinqiang, YuWenyuan, ZhangYanfeng, GengLiang, YuSong, YuGe, ZhouJingren
{"title":"Automating incremental graph processing with flexible memoization","authors":"GongShufeng, TianChao, Yinqiang, YuWenyuan, ZhangYanfeng, GengLiang, YuSong, YuGe, ZhouJingren","doi":"10.14778/3461535.3461550","DOIUrl":"https://doi.org/10.14778/3461535.3461550","url":null,"abstract":"The ever-growing amount of dynamic graph data demands efficient techniques of incremental graph processing. However, incremental graph algorithms are challenging to develop. Existing approaches usu...","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121921246","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
Comprehensible counterfactual explanation on Kolmogorov-Smirnov test 关于Kolmogorov-Smirnov检验的可理解反事实解释
Very Large Data Bases Conference Pub Date : 2021-05-01 DOI: 10.14778/3461535.3461546
CongZicun, ChuLingyang, YangYu, PeiJian
{"title":"Comprehensible counterfactual explanation on Kolmogorov-Smirnov test","authors":"CongZicun, ChuLingyang, YangYu, PeiJian","doi":"10.14778/3461535.3461546","DOIUrl":"https://doi.org/10.14778/3461535.3461546","url":null,"abstract":"The Kolmogorov-Smirnov (KS) test is popularly used in many applications, such as anomaly detection, astronomy, database security and AI systems. One challenge remained untouched is how we can obtai...","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116774373","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
Raster databases 栅格数据库
Very Large Data Bases Conference Pub Date : 2007-09-23 DOI: 10.1007/978-0-387-39940-9_3417
P. Baumann
{"title":"Raster databases","authors":"P. Baumann","doi":"10.1007/978-0-387-39940-9_3417","DOIUrl":"https://doi.org/10.1007/978-0-387-39940-9_3417","url":null,"abstract":"","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125556189","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
Secure Data Outsourcing 安全的数据外包
Very Large Data Bases Conference Pub Date : 2007-09-23 DOI: 10.1007/springerreference_63451
R. Sion
{"title":"Secure Data Outsourcing","authors":"R. Sion","doi":"10.1007/springerreference_63451","DOIUrl":"https://doi.org/10.1007/springerreference_63451","url":null,"abstract":"","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133080810","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}
引用次数: 52
SPIDER: an autonomic computing approach to database security management SPIDER:数据库安全管理的自主计算方法
Very Large Data Bases Conference Pub Date : 2006-09-10 DOI: 10.1007/11844662_13
H. Hacigumus
{"title":"SPIDER: an autonomic computing approach to database security management","authors":"H. Hacigumus","doi":"10.1007/11844662_13","DOIUrl":"https://doi.org/10.1007/11844662_13","url":null,"abstract":"","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133799646","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}
引用次数: 1
Incremental schema matching 增量模式匹配
Very Large Data Bases Conference Pub Date : 2006-09-01 DOI: 10.5555/1182635.1164235
P. Bernstein, S. Melnik, J. E. Churchill
{"title":"Incremental schema matching","authors":"P. Bernstein, S. Melnik, J. E. Churchill","doi":"10.5555/1182635.1164235","DOIUrl":"https://doi.org/10.5555/1182635.1164235","url":null,"abstract":"The goal of schema matching is to identify correspondences between the elements of two schemas. Most schema matching systems calculate and display the entire set of correspondences in a single shot. Invariably, the result presented to the engineer includes many false positives, especially for large schemas. The user is often overwhelmed by all of the edges, annoyed by the false positives, and frustrated at the inability to see second- and third-best choices. We demonstrate a tool that circumvents these problems by doing the matching interactively. The tool suggests candidate matches for a selected schema element and allows convenient navigation between the candidates. The ranking of match candidates is based on lexical similarity, schema structure, element types, and the history of prior matching actions. The technical challenges are to make the match algorithm fast enough for incremental matching in large schemas and to devise a user interface that avoids overwhelming the user. The tool has been integrated with a prototype version of Microsoft BizTalk Mapper, a visual programming tool for generating XML-to-XML mappings.","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"604 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115601442","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}
引用次数: 98
GignoMDA: exploiting cross-layer optimization for complex database applications GignoMDA:为复杂的数据库应用程序开发跨层优化
Very Large Data Bases Conference Pub Date : 2006-09-01 DOI: 10.5555/1182635.1164256
Dirk Habich, Sebastian Richly, Wolfgang Lehner
{"title":"GignoMDA: exploiting cross-layer optimization for complex database applications","authors":"Dirk Habich, Sebastian Richly, Wolfgang Lehner","doi":"10.5555/1182635.1164256","DOIUrl":"https://doi.org/10.5555/1182635.1164256","url":null,"abstract":"Database Systems are often used as persistent layer for applications. This implies that database schemas are generated out of transient programming class descriptions. The basic idea of the MDA approach generalizes this principle by providing a framework to generate applications (and database schemas) for different programming platforms. Within our GignoMDA project [3]--which is subject of this demo proposal--we have extended classic concepts for code generation. That means, our approach provides a single point of truth describing all aspects of database applications (e.g. database schema, project documentation,...) with great potential for cross-layer optimization. These new cross-layer optimization hints are a novel way for the challenging global optimization issue of multi-tier database applications. The demo at VLDB comprises an in-depth explanation of our concepts and the prototypical implementation by directly demonstrating the modeling and the automatic generation of database applications.","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133265820","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
NUITS: a novel user interface for efficient keyword search over databases NUITS:一个新颖的用户界面，用于在数据库上进行高效的关键字搜索
Very Large Data Bases Conference Pub Date : 2006-09-01 DOI: 10.5555/1182635.1164229
Shan Wang, Zhaohui Peng, Jun Zhang, Lu Qin, Shengbao Wang, J. Yu, Bolin Ding
{"title":"NUITS: a novel user interface for efficient keyword search over databases","authors":"Shan Wang, Zhaohui Peng, Jun Zhang, Lu Qin, Shengbao Wang, J. Yu, Bolin Ding","doi":"10.5555/1182635.1164229","DOIUrl":"https://doi.org/10.5555/1182635.1164229","url":null,"abstract":"The integration of database and information retrieval techniques provides users with a wide range of high quality services. We present a prototype system, called NUITS, for efficiently processing keyword queries on top of a relational database. Our NUITS allows users to issue simple keyword queries as well as advanced keyword queries with conditions. The efficiency of keyword query processing and the user-friendly result display will also be addressed in this paper.","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116435149","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}
引用次数: 31
LinkClus: efficient clustering via heterogeneous semantic links LinkClus:通过异构语义链接高效聚类
Very Large Data Bases Conference Pub Date : 2006-09-01 DOI: 10.5555/1182635.1164165
Xiaoxin Yin, Jiawei Han, Philip S. Yu
{"title":"LinkClus: efficient clustering via heterogeneous semantic links","authors":"Xiaoxin Yin, Jiawei Han, Philip S. Yu","doi":"10.5555/1182635.1164165","DOIUrl":"https://doi.org/10.5555/1182635.1164165","url":null,"abstract":"Data objects in a relational database are cross-linked with each other via multi-typed links. Links contain rich semantic information that may indicate important relationships among objects. Most current clustering methods rely only on the properties that belong to the objects per se. However, the similarities between objects are often indicated by the links, and desirable clusters cannot be generated using only the properties of objects.In this paper we explore linkage-based clustering, in which the similarity between two objects is measured based on the similarities between the objects linked with them. In comparison with a previous study (SimRank) that computes links recursively on all pairs of objects, we take advantage of the power law distribution of links, and develop a hierarchical structure called SimTree to represent similarities in multi-granularity manner. This method avoids the high cost of computing and storing pairwise similarities but still thoroughly explore relationships among objects. An efficient algorithm is proposed to compute similarities between objects by avoiding pairwise similarity computations through merging computations that go through the same branches in the SimTree. Experiments show the proposed approach achieves high efficiency, scalability, and accuracy in clustering multi-typed linked objects.","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127942923","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}
引用次数: 141
Efficient XSLT processing in relational database system 关系型数据库系统中高效的XSLT处理
Very Large Data Bases Conference Pub Date : 2006-09-01 DOI: 10.5555/1182635.1164225
Z. Liu, A. Novoselsky
{"title":"Efficient XSLT processing in relational database system","authors":"Z. Liu, A. Novoselsky","doi":"10.5555/1182635.1164225","DOIUrl":"https://doi.org/10.5555/1182635.1164225","url":null,"abstract":"Efficient processing of XQuery, XPath and SQL/XML on XML documents stored and managed in RDBMS has been widely studied. However, much less of such type of work has been done for efficient XSLT processing of XML documents stored and managed by the database. This is partially due to the observation that the rule based template driven XSLT execution model does not fit nicely with the traditional declarative query language processing model which leverages index probing and iterator based pull mode that can be scaled to handle large size data. In this paper, we share our experience of efficient processing of XSLT in Oracle XML DB. We present the technique of processing XSLT efficiently in database by rewriting XSLT stylesheets into highly efficient XQuery through partially evaluating XSLT over the XML documents structural information. Consequently, we can leverage all the work done for efficient XQuery/XPath processing in database to achieve combined optimisations of XSLT with XQuery/XPath and SQL/XML in Oracle XMLDB. This effectively makes XSLT processing scale to large size XML documents using classical declarative query processing techniques in DBMS.","PeriodicalId":307514,"journal":{"name":"Very Large Data Bases Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133259285","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书