首页 > 最新文献

Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)最新文献

英文 中文
Unraveling the duplicate-elimination problem in XML-to-SQL query translation 揭示xml到sql查询转换中的重复消除问题
R. Krishnamurthy, R. Kaushik, J. Naughton
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have two different notions of duplicates: node-identity based and value-based. Path expression queries have an implicit node-identity based duplicate elimination built into them. On the other hand, SQL only supports value-based duplicate elimination. In this paper, using a simple path expression query we illustrate the problems that arise when we attempt to simulate the node-identity based duplicate elimination using value-based duplicate elimination in the SQL queries. We show how a general solution for this problem covering the class of views considered in published literature requires a fairly complex mechanism.
我们考虑将现有关系数据导出为XML的场景。在本文中,我们将讨论将XML查询转换为SQL的问题。XML查询语言有两种不同的重复概念:基于节点标识的和基于值的。路径表达式查询内置了隐式的基于节点标识的重复消除功能。另一方面,SQL只支持基于值的重复消除。在本文中,我们使用一个简单的路径表达式查询说明了当我们试图在SQL查询中使用基于值的重复消除来模拟基于节点身份的重复消除时出现的问题。我们展示了这个问题的一般解决方案如何涵盖已发表文献中考虑的视图类,需要一个相当复杂的机制。
{"title":"Unraveling the duplicate-elimination problem in XML-to-SQL query translation","authors":"R. Krishnamurthy, R. Kaushik, J. Naughton","doi":"10.1145/1017074.1017088","DOIUrl":"https://doi.org/10.1145/1017074.1017088","url":null,"abstract":"We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have two different notions of duplicates: node-identity based and value-based. Path expression queries have an implicit node-identity based duplicate elimination built into them. On the other hand, SQL only supports value-based duplicate elimination. In this paper, using a simple path expression query we illustrate the problems that arise when we attempt to simulate the node-identity based duplicate elimination using value-based duplicate elimination in the SQL queries. We show how a general solution for this problem covering the class of views considered in published literature requires a fairly complex mechanism.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"48 1","pages":"49-54"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76922060","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}
引用次数: 6
Scalable dissemination: what's hot and what's not 可扩展传播:什么是热门的,什么是不热门的
J. Beaver, Nicholas Morsillo, K. Pruhs, Panos K. Chrysanthis, V. Liberatore
A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses multicast push to scalably deliver the most popular data, and reserves traditional unicast pull for delivery of less popular data. However, such a hybrid scheme introduces a variety of data management problems at the server. In this paper we examine three of these problems: the push popularity problem, the document classification problem, and the bandwidth division problem. The push popularity problem is to estimate the popularity of the documents in the web site. The document classification problem is to determine which documents should be pushed and which documents must be pulled. The band-width division problem is to determine how much of the server bandwidth to devote to pushed documents and how much of the server bandwidth should be reserved for pulled documents. We propose simple and elegant solutions for these problems. We report on experiments with our system that validate our algorithms.
一般来说,web数据库应用程序和Internet上的一个主要问题是数据的可伸缩交付。针对这个问题提出的一个解决方案是一个混合系统,它使用多播推送来可扩展地交付最流行的数据,而保留传统的单播拉来交付不太流行的数据。然而,这种混合方案在服务器端引入了各种数据管理问题。本文研究了其中的三个问题:推送流行度问题、文档分类问题和带宽划分问题。推热度问题是估计文档在网站中的热度。文档分类问题是确定哪些文档应该推送,哪些文档必须拉出。带宽划分问题是确定要将多少服务器带宽用于推送文档,以及应该为提取文档保留多少服务器带宽。我们为这些问题提出了简单而优雅的解决方案。我们报告了用我们的系统验证我们的算法的实验。
{"title":"Scalable dissemination: what's hot and what's not","authors":"J. Beaver, Nicholas Morsillo, K. Pruhs, Panos K. Chrysanthis, V. Liberatore","doi":"10.1145/1017074.1017084","DOIUrl":"https://doi.org/10.1145/1017074.1017084","url":null,"abstract":"A major problem in web database applications and on the Internet in general is the scalable delivery of data. One proposed solution for this problem is a hybrid system that uses multicast push to scalably deliver the most popular data, and reserves traditional unicast pull for delivery of less popular data. However, such a hybrid scheme introduces a variety of data management problems at the server. In this paper we examine three of these problems: the push popularity problem, the document classification problem, and the bandwidth division problem. The push popularity problem is to estimate the popularity of the documents in the web site. The document classification problem is to determine which documents should be pushed and which documents must be pulled. The band-width division problem is to determine how much of the server bandwidth to devote to pushed documents and how much of the server bandwidth should be reserved for pulled documents. We propose simple and elegant solutions for these problems. We report on experiments with our system that validate our algorithms.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"37 1","pages":"31-36"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81781715","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}
引用次数: 11
Visualizing and discovering web navigational patterns 可视化和发现web导航模式
Jiyang Chen, Lisheng Sun, Osmar R Zaiane, R. Goebel
Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analysis is necessary to discover useful patterns and understand the navigational behaviour of web site visitors, whether to improve web site structures, provide intelligent on-line tools or offer support to human decision makers. Moreover, interactive investigation of web access logs is often desired since it allows ad hoc discovery and examination of patterns not a priori known. Various visualization tools have been provided for this task but they often lack the functionality to conveniently generate new patterns. In this paper we propose a visualization tool to visualize web graphs, representations of web structure overlaid with information and pattern tiers. We also propose a web graph algebra to manipulate and combine web graphs and their layers in order to discover new patterns in an ad hoc manner.
网站结构分析起来很复杂。交叉引用web结构和导航行为增加了分析的复杂性。然而,这种复杂的分析对于发现有用的模式和了解网站访问者的导航行为是必要的,无论是改善网站结构,提供智能在线工具还是为人类决策者提供支持。此外,通常需要对web访问日志进行交互式调查,因为它允许对非先验已知的模式进行特别的发现和检查。已经为这项任务提供了各种可视化工具,但它们通常缺乏方便地生成新模式的功能。在本文中,我们提出了一个可视化的工具,以可视化的网络图形,表示网络结构覆盖的信息和模式层。我们还提出了一个网络图代数来操作和组合网络图及其层,以便以一种特殊的方式发现新的模式。
{"title":"Visualizing and discovering web navigational patterns","authors":"Jiyang Chen, Lisheng Sun, Osmar R Zaiane, R. Goebel","doi":"10.1145/1017074.1017079","DOIUrl":"https://doi.org/10.1145/1017074.1017079","url":null,"abstract":"Web site structures are complex to analyze. Cross-referencing the web structure with navigational behaviour adds to the complexity of the analysis. However, this convoluted analysis is necessary to discover useful patterns and understand the navigational behaviour of web site visitors, whether to improve web site structures, provide intelligent on-line tools or offer support to human decision makers. Moreover, interactive investigation of web access logs is often desired since it allows ad hoc discovery and examination of patterns not a priori known. Various visualization tools have been provided for this task but they often lack the functionality to conveniently generate new patterns. In this paper we propose a visualization tool to visualize web graphs, representations of web structure overlaid with information and pattern tiers. We also propose a web graph algebra to manipulate and combine web graphs and their layers in order to discover new patterns in an ad hoc manner.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"5 1","pages":"13-18"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86102695","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}
引用次数: 47
Best-match querying from document-centric XML 从以文档为中心的XML进行最佳匹配查询
J. Kamps, maarten marx, M. de Rijke, Börkur Sigurbjörnsson
On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such document-centric XML collections require a query language that can gracefully handle structural constraints as well as constraints on the free text of the documents. Our main contributions are three-fold. First, we outline two fragments of XPath tailored to users that have varying degrees of understanding of the XML structure used, and give both syntactic and semantic characterizations of these fragments. Second, we extend XPath with an about function having a best-match semantics based on the relevance of the document component for the expressed information need. Third, we evaluate the resulting query language using the INEX 2003 test suite, and show that best-match approaches outperform exact-match approaches for evaluating content-and-structure queries.
在Web上,普遍使用XML为文本集合提供轻量级语义。这种以文档为中心的XML集合需要一种能够优雅地处理结构约束和文档自由文本约束的查询语言。我们的主要贡献有三方面。首先,我们概述了为对所使用的XML结构有不同理解程度的用户量身定制的两个XPath片段,并给出了这些片段的语法和语义特征。其次,我们使用一个about函数扩展XPath,该函数具有基于文档组件与所表达的信息需求的相关性的最佳匹配语义。第三,我们使用INEX 2003测试套件评估结果查询语言,并表明在评估内容和结构查询时,最佳匹配方法优于精确匹配方法。
{"title":"Best-match querying from document-centric XML","authors":"J. Kamps, maarten marx, M. de Rijke, Börkur Sigurbjörnsson","doi":"10.1145/1017074.1017089","DOIUrl":"https://doi.org/10.1145/1017074.1017089","url":null,"abstract":"On the Web, there is a pervasive use of XML to give lightweight semantics to textual collections. Such document-centric XML collections require a query language that can gracefully handle structural constraints as well as constraints on the free text of the documents. Our main contributions are three-fold. First, we outline two fragments of XPath tailored to users that have varying degrees of understanding of the XML structure used, and give both syntactic and semantic characterizations of these fragments. Second, we extend XPath with an about function having a best-match semantics based on the relevance of the document component for the expressed information need. Third, we evaluate the resulting query language using the INEX 2003 test suite, and show that best-match approaches outperform exact-match approaches for evaluating content-and-structure queries.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"36 1","pages":"55-60"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75119231","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}
引用次数: 18
Querying bi-level information 查询双级信息
S. Murthy, D. Maier, L. Delcambre
In our research on superimposed information management, we have developed applications where information elements in the superimposed layer serve to annotate, comment, restructure, and combine selections from one or more existing documents in the base layer. Base documents tend to be unstructured or semi-structured (HTML pages, Excel spreadsheets, and so on) with marks delimiting selections. Selections in the base layer can be programmatically accessed via marks to retrieve content and context. The applications we have built to date allow creation of new marks and new superimposed elements (that use marks), but they have been browse-oriented and tend to expose the line between superimposed and base layers. Here, we present a new access capability, called bi-level queries, that allows an application or user to query over both layers as a whole. Bi-level queries provide an alternative style of data integration where only relevant portions of a base document are mediated (not the whole document) and the superimposed layer can add information not present in the base layer. We discuss our framework for superimposed information management, an initial implementation of a bi-level query system with an XML Query interface, and suggest mechanisms to improve scalability and performance.
在我们对叠加信息管理的研究中,我们开发了一些应用程序,在这些应用程序中,叠加层中的信息元素用于注释、评论、重组和组合来自基础层中一个或多个现有文档的选择。基本文档往往是非结构化或半结构化的(HTML页面、Excel电子表格等),用标记分隔选择。可以通过标记以编程方式访问基础层中的选择,以检索内容和上下文。到目前为止,我们构建的应用程序允许创建新的标记和新的叠加元素(使用标记),但是它们都是面向浏览器的,并且倾向于暴露叠加层和基础层之间的界限。在这里,我们提出了一种新的访问功能,称为双层查询,它允许应用程序或用户作为一个整体在两层上进行查询。双层查询提供了一种数据集成的替代样式,其中只中介基本文档的相关部分(而不是整个文档),并且叠加层可以添加基础层中不存在的信息。我们讨论了用于叠加信息管理的框架,一个带有XML query接口的双层查询系统的初始实现,并提出了改进可伸缩性和性能的机制。
{"title":"Querying bi-level information","authors":"S. Murthy, D. Maier, L. Delcambre","doi":"10.1145/1017074.1017078","DOIUrl":"https://doi.org/10.1145/1017074.1017078","url":null,"abstract":"In our research on superimposed information management, we have developed applications where information elements in the superimposed layer serve to annotate, comment, restructure, and combine selections from one or more existing documents in the base layer. Base documents tend to be unstructured or semi-structured (HTML pages, Excel spreadsheets, and so on) with marks delimiting selections. Selections in the base layer can be programmatically accessed via marks to retrieve content and context. The applications we have built to date allow creation of new marks and new superimposed elements (that use marks), but they have been browse-oriented and tend to expose the line between superimposed and base layers. Here, we present a new access capability, called bi-level queries, that allows an application or user to query over both layers as a whole. Bi-level queries provide an alternative style of data integration where only relevant portions of a base document are mediated (not the whole document) and the superimposed layer can add information not present in the base layer. We discuss our framework for superimposed information management, an initial implementation of a bi-level query system with an XML Query interface, and suggest mechanisms to improve scalability and performance.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"2014 1","pages":"7-12"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73996505","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}
引用次数: 14
DTDs versus XML schema: a practical study dtd与XML模式:一个实用的研究
G. Bex, F. Neven, J. V. D. Bussche
Among the various proposals answering the shortcomings of Document Type Definitions (DTDs), XML Schema is the most widely used. Although DTDs and XML Schema Definitions (XSDs) differ syntactically, they are still quite related on an abstract level. Indeed, freed from all syntactic sugar, XML Schemas can be seen as an extension of DTDs with a restricted form of specialization. In the present paper, we inspect a number of DTDs and XSDs harvested from the web and try to answer the following questions: (1) which of the extra features/expressiveness of XML Schema not allowed by DTDs are effectively used in practice; and, (2) how sophisticated are the structural properties (i.e. the nature of regular expressions) of the two formalisms. It turns out that at present real-world XSDs only sparingly use the new features introduced by XML Schema: on a structural level the vast majority of them can already be defined by DTDs. Further, we introduce a class of simple regular expressions and obtain that a surprisingly high fraction of the content models belong to this class. The latter result sheds light on the justification of simplifying assumptions that sometimes have to be made in XML research.
在解决文档类型定义(dtd)缺点的各种建议中,XML Schema是使用最广泛的。尽管dtd和XML模式定义(XML Schema definition, xsd)在语法上有所不同,但它们在抽象级别上仍然非常相关。实际上,从所有语法糖中解放出来后,XML schema可以被看作是dtd的扩展,具有限制形式的专门化。在本文中,我们考察了一些从web获取的dtd和xsd,并试图回答以下问题:(1)哪些dtd不允许的XML Schema的额外特性/表达性在实践中得到了有效的使用;(2)两种形式的结构属性(即正则表达式的性质)有多复杂。事实证明,目前实际的xsd很少使用XML Schema引入的新特性:在结构级别上,它们中的绝大多数已经可以由dtd定义。此外,我们引入了一类简单的正则表达式,并获得了令人惊讶的高比例的内容模型属于该类。后一个结果阐明了在XML研究中有时必须做出的简化假设的理由。
{"title":"DTDs versus XML schema: a practical study","authors":"G. Bex, F. Neven, J. V. D. Bussche","doi":"10.1145/1017074.1017095","DOIUrl":"https://doi.org/10.1145/1017074.1017095","url":null,"abstract":"Among the various proposals answering the shortcomings of Document Type Definitions (DTDs), XML Schema is the most widely used. Although DTDs and XML Schema Definitions (XSDs) differ syntactically, they are still quite related on an abstract level. Indeed, freed from all syntactic sugar, XML Schemas can be seen as an extension of DTDs with a restricted form of specialization. In the present paper, we inspect a number of DTDs and XSDs harvested from the web and try to answer the following questions: (1) which of the extra features/expressiveness of XML Schema not allowed by DTDs are effectively used in practice; and, (2) how sophisticated are the structural properties (i.e. the nature of regular expressions) of the two formalisms. It turns out that at present real-world XSDs only sparingly use the new features introduced by XML Schema: on a structural level the vast majority of them can already be defined by DTDs. Further, we introduce a class of simple regular expressions and obtain that a surprisingly high fraction of the content models belong to this class. The latter result sheds light on the justification of simplifying assumptions that sometimes have to be made in XML research.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"29 1","pages":"79-84"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81163356","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}
引用次数: 180
Semantic multicast for content-based stream dissemination 基于内容的流传播的语义组播
Olga Papaemmanouil, U. Çetintemel
We consider the problem of content-based routing and dissemination of highly-distributed, fast data streams from multiple sources to multiple receivers. Our target application domain includes real-time, stream-based monitoring applications and large-scale event dissemination. We introduce SemCast, a new semantic multicast approach that, unlike previous approaches, eliminates the need for content-based forwarding at interior brokers and facilitates fine-grained control over the construction of dissemination overlays. We present the initial design of SemCast and provide an outline of the architectural and algorithmic challenges as well as our initial solutions. Preliminary experimental results show that SemCast can significantly reduce overall bandwidth requirements compared to traditional event-dissemination approaches.
我们考虑了基于内容的路由和从多个源到多个接收者的高度分布式、快速数据流的传播问题。我们的目标应用领域包括实时、基于流的监控应用和大规模事件传播。我们介绍了SemCast,这是一种新的语义多播方法,与以前的方法不同,它消除了在内部代理中基于内容的转发的需要,并促进了对传播覆盖结构的细粒度控制。我们介绍了SemCast的初始设计,并概述了架构和算法挑战以及我们的初始解决方案。初步实验结果表明,与传统的事件传播方法相比,SemCast可以显著降低总体带宽需求。
{"title":"Semantic multicast for content-based stream dissemination","authors":"Olga Papaemmanouil, U. Çetintemel","doi":"10.1145/1017074.1017085","DOIUrl":"https://doi.org/10.1145/1017074.1017085","url":null,"abstract":"We consider the problem of content-based routing and dissemination of highly-distributed, fast data streams from multiple sources to multiple receivers. Our target application domain includes real-time, stream-based monitoring applications and large-scale event dissemination. We introduce SemCast, a new semantic multicast approach that, unlike previous approaches, eliminates the need for content-based forwarding at interior brokers and facilitates fine-grained control over the construction of dissemination overlays. We present the initial design of SemCast and provide an outline of the architectural and algorithmic challenges as well as our initial solutions. Preliminary experimental results show that SemCast can significantly reduce overall bandwidth requirements compared to traditional event-dissemination approaches.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"438 1","pages":"37-42"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76776563","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}
引用次数: 19
Checking potential validity of XML documents 检查XML文档的潜在有效性
I. Iacob, Alex Dekhtyar, M. Dekhtyar
The process of creation of document-centric XML documents often starts with a prepared textual content, into which the editor introduces markup. In such situations, intermediate XML is almost never valid with respect to the DTD/Schema used for the encoding. At the same time, it is important to ensure that at each moment of time, the editor is working with an XML document that can enriched with further markup to become valid. In this paper we introduce the notion of potential validity of XML documents, which allows us to distinguish between XML documents that are invalid because the encoding is simply incomplete and XML documents that are invalid because some of the DTD rules guiding the structure of the encoding were violated during the markup process. We give a linear-time algorithm for checking potential validity for documents.
以文档为中心的XML文档的创建过程通常从准备好的文本内容开始,编辑器在其中引入标记。在这种情况下,相对于用于编码的DTD/Schema,中间XML几乎永远无效。同时,重要的是要确保编辑器在任何时候使用的XML文档都可以通过进一步的标记进行丰富,从而变得有效。在本文中,我们引入了XML文档潜在有效性的概念,它允许我们区分由于编码不完整而无效的XML文档和由于在标记过程中违反了指导编码结构的某些DTD规则而无效的XML文档。我们给出了一个线性时间算法来检查文档的潜在有效性。
{"title":"Checking potential validity of XML documents","authors":"I. Iacob, Alex Dekhtyar, M. Dekhtyar","doi":"10.1145/1017074.1017097","DOIUrl":"https://doi.org/10.1145/1017074.1017097","url":null,"abstract":"The process of creation of document-centric XML documents often starts with a prepared textual content, into which the editor introduces markup. In such situations, intermediate XML is almost never valid with respect to the DTD/Schema used for the encoding. At the same time, it is important to ensure that at each moment of time, the editor is working with an XML document that can enriched with further markup to become valid. In this paper we introduce the notion of potential validity of XML documents, which allows us to distinguish between XML documents that are invalid because the encoding is simply incomplete and XML documents that are invalid because some of the DTD rules guiding the structure of the encoding were violated during the markup process. We give a linear-time algorithm for checking potential validity for documents.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"38 1","pages":"91-96"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80683901","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}
引用次数: 6
Challenges in selecting paths for navigational queries: trade-off of benefit of path versus cost of plan 为导航查询选择路径的挑战:路径收益与计划成本的权衡
Maria-Esther Vidal, L. Raschid, Julián Mestre
Life sciences sources are characterized by a complex graph of overlapping sources, and multiple alternate links between sources. A (navigational) query may be answered by traversing multiple alternate paths between a start source and a target source. Each of these paths may have dissimilar benefit, e.g., the cardinality of result objects that are reached in the target source. Paths may also have dissimilar costs of evaluation, i.e., the execution cost of a query evaluation plan for a path. In prior research, we developed ESearch, an algorithm based on a Deterministic Finite Automaton (DFA), which exhaustively enumerates all paths to answer a navigational query. The challenge is to develop heuristics that improve on the exhaustive ESearch solution and identify good utility functions that can rank the sources, the links between sources, and the sub-paths that are already visited, in order to quickly produce paths that have the highest benefit and the least cost. In this paper, we present a heuristic that uses local utility functions to rank sources, using either the benefit attributed to the source, the cost of a plan using the source, or both. The heuristic will limit its search to some Top XX% of the ranked sources. To compare ESearch and the heuristic, we construct a Pareto surface of all dominant solutions produced by ESearch, with respect to benefit and cost. We choose the Top 25% of the ESearch solutions that are in the Pareto surface. We compare the paths produced by the heuristic to this Top 25% of ESearch solutions with respect to precision and recall. This motivates the need for further research on developing a more efficient algorithm and better utility functions.
生命科学资源的特点是重叠资源的复杂图,以及资源之间的多个交替链接。(导航)查询可以通过遍历起始源和目标源之间的多个备选路径来回答。这些路径中的每一个都可能有不同的好处,例如,在目标源中到达的结果对象的基数。路径也可能具有不同的求值成本,即路径的查询求值计划的执行成本。在之前的研究中,我们开发了一种基于确定性有限自动机(DFA)的算法search,它详尽地枚举所有路径来回答导航查询。我们面临的挑战是开发启发式方法,改进穷尽式研究解决方案,并确定能够对资源、资源之间的链接和已访问的子路径进行排序的良好效用函数,以便快速生成具有最高收益和最低成本的路径。在本文中,我们提出了一种启发式方法,使用局部效用函数对资源进行排序,使用归因于资源的收益,使用资源的计划成本,或两者兼而有之。启发式将其搜索限制在排名前XX%的来源。为了比较研究和启发式,我们构建了一个关于收益和成本的研究产生的所有主导解决方案的帕累托曲面。我们选择在帕累托曲面上的前25%的研究解决方案。我们将启发式生成的路径与研究解决方案中精确度和召回率最高的25%的路径进行比较。这激发了进一步研究开发更有效的算法和更好的效用函数的需求。
{"title":"Challenges in selecting paths for navigational queries: trade-off of benefit of path versus cost of plan","authors":"Maria-Esther Vidal, L. Raschid, Julián Mestre","doi":"10.1145/1017074.1017091","DOIUrl":"https://doi.org/10.1145/1017074.1017091","url":null,"abstract":"Life sciences sources are characterized by a complex graph of overlapping sources, and multiple alternate links between sources. A (navigational) query may be answered by traversing multiple alternate paths between a start source and a target source. Each of these paths may have dissimilar benefit, e.g., the cardinality of result objects that are reached in the target source. Paths may also have dissimilar costs of evaluation, i.e., the execution cost of a query evaluation plan for a path. In prior research, we developed ESearch, an algorithm based on a Deterministic Finite Automaton (DFA), which exhaustively enumerates all paths to answer a navigational query. The challenge is to develop heuristics that improve on the exhaustive ESearch solution and identify good utility functions that can rank the sources, the links between sources, and the sub-paths that are already visited, in order to quickly produce paths that have the highest benefit and the least cost. In this paper, we present a heuristic that uses local utility functions to rank sources, using either the benefit attributed to the source, the cost of a plan using the source, or both. The heuristic will limit its search to some Top XX% of the ranked sources. To compare ESearch and the heuristic, we construct a Pareto surface of all dominant solutions produced by ESearch, with respect to benefit and cost. We choose the Top 25% of the ESearch solutions that are in the Pareto surface. We compare the paths produced by the heuristic to this Top 25% of ESearch solutions with respect to precision and recall. This motivates the need for further research on developing a more efficient algorithm and better utility functions.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"152 1","pages":"61-66"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74769226","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}
引用次数: 13
One torus to rule them all: multi-dimensional queries in P2P systems 一个环可以统治所有的环:P2P系统中的多维查询
Prasanna Ganesan, Beverly Yang, H. Garcia-Molina
Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only simple lookup queries. However, many new applications, such as P2P photo sharing and massively multi-player games, would benefit greatly from support for multidimensional range queries. We show how such queries may be supported in a P2P system by adapting traditional spatial-database technologies with novel P2P routing networks and load-balancing algorithms. We show how to adapt two popular spatial-database solutions - kd-trees and space-filling curves - and experimentally compare their effectiveness.
点对点系统可以访问分布在大量机器上的数据。大多数P2P系统只支持简单的查找查询。然而,许多新的应用程序,如P2P照片共享和大型多人游戏,将从对多维范围查询的支持中受益匪浅。我们展示了如何在P2P系统中通过将传统的空间数据库技术与新颖的P2P路由网络和负载平衡算法相适应来支持此类查询。我们展示了如何适应两种流行的空间数据库解决方案——kd树和空间填充曲线——并通过实验比较了它们的有效性。
{"title":"One torus to rule them all: multi-dimensional queries in P2P systems","authors":"Prasanna Ganesan, Beverly Yang, H. Garcia-Molina","doi":"10.1145/1017074.1017081","DOIUrl":"https://doi.org/10.1145/1017074.1017081","url":null,"abstract":"Peer-to-peer systems enable access to data spread over an extremely large number of machines. Most P2P systems support only simple lookup queries. However, many new applications, such as P2P photo sharing and massively multi-player games, would benefit greatly from support for multidimensional range queries. We show how such queries may be supported in a P2P system by adapting traditional spatial-database technologies with novel P2P routing networks and load-balancing algorithms. We show how to adapt two popular spatial-database solutions - kd-trees and space-filling curves - and experimentally compare their effectiveness.","PeriodicalId":93360,"journal":{"name":"Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)","volume":"111 1","pages":"19-24"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79209748","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}
引用次数: 270
期刊
Proceedings of the 5th International Workshop on Exploratory Search in Databases and the Web. International Workshop on Exploratory Search in Databases and the Web (5th : 2018 : Houston, Tex.)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1