首页 > 最新文献

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.)最新文献

英文 中文
On validation of XML streams using finite state machines 关于使用有限状态机验证XML流
Cristiana Chitic, D. Rosu
We study validation of streamed XML documents by means of finite state machines. Previous work has shown that validation is in principle possible by finite state automata, but the construction was prohibitively expensive, giving an exponential-size nondeterministic automaton. Instead, we want to find deterministic automata for validating streamed documents: for them, the complexity of validation is constant per tag. We show that for a reading window of size one and nonrecursive DTDs with one-unambiguous content (i.e. conforming to the current XML standard) there is an algorithm producing a deterministic automaton that validates documents with respect to that DTD. The size of the automaton is at most exponential and we give matching lower bounds. To capture the possible advantages offered by reading windows of size k, we introduce k-unambiguity as a generalization of one-unambiguity, and study the validation against DTDs with k-unambiguous content. We also consider recursive DTDs and give conditions under which they can be validated against by using one-counter automata.
我们研究了用有限状态机对流XML文档进行验证。先前的工作表明,原则上可以通过有限状态自动机进行验证,但构造过于昂贵,给出了指数大小的不确定性自动机。相反,我们希望找到用于验证流文档的确定性自动机:对于它们,每个标记的验证复杂性是恒定的。我们展示了对于大小为1的读取窗口和具有一个明确内容(即符合当前XML标准)的非递归DTD,存在一种生成确定性自动机的算法,该算法根据该DTD验证文档。自动机的大小不超过指数,我们给出了匹配的下界。为了捕捉大小为k的阅读窗口可能提供的优势,我们引入了k-无歧义作为1 -无歧义的推广,并研究了具有k-无歧义内容的dtd的验证。我们还考虑了递归dtd,并给出了使用单计数器自动机验证它们的条件。
{"title":"On validation of XML streams using finite state machines","authors":"Cristiana Chitic, D. Rosu","doi":"10.1145/1017074.1017096","DOIUrl":"https://doi.org/10.1145/1017074.1017096","url":null,"abstract":"We study validation of streamed XML documents by means of finite state machines. Previous work has shown that validation is in principle possible by finite state automata, but the construction was prohibitively expensive, giving an exponential-size nondeterministic automaton. Instead, we want to find deterministic automata for validating streamed documents: for them, the complexity of validation is constant per tag. We show that for a reading window of size one and nonrecursive DTDs with one-unambiguous content (i.e. conforming to the current XML standard) there is an algorithm producing a deterministic automaton that validates documents with respect to that DTD. The size of the automaton is at most exponential and we give matching lower bounds. To capture the possible advantages offered by reading windows of size k, we introduce k-unambiguity as a generalization of one-unambiguity, and study the validation against DTDs with k-unambiguous content. We also consider recursive DTDs and give conditions under which they can be validated against by using one-counter automata.","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":"41 1","pages":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88824163","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}
引用次数: 46
Content and structure in indexing and ranking XML 索引和排序XML中的内容和结构
Felix Weigel, H. Meuss, K. Schulz, François Bry
Rooted in electronic publishing, XML is now widely used for modelling and storing structured text documents. Especially in the WWW, retrieval of XML documents is most useful in combination with a relevance-based ranking of the query result. Index structures with ranking support are therefore needed for fast access to relevant parts of large document collections. This paper proposes a classification scheme for both XML ranking models and index structures, allowing to determine which index suits which ranking model. An analysis reveals that ranking parameters related to both the content and structure of the data are poorly supported by most known XML indices. The IR-CADG index, owing to its tight integration of content and structure, supports various XML ranking models in a very efficient retrieval process. Experiments show that it outperforms separate content/structure indexing by more than two orders of magnitude for large corpora of several hundred MB.
XML起源于电子出版,现在广泛用于建模和存储结构化文本文档。特别是在WWW中,XML文档的检索与基于相关性的查询结果排序相结合是最有用的。因此,需要具有排序支持的索引结构来快速访问大型文档集合的相关部分。本文为XML排序模型和索引结构提出了一种分类方案,允许确定哪个索引适合哪个排序模型。分析表明,大多数已知的XML索引都不支持与数据的内容和结构相关的排序参数。IR-CADG索引由于其内容和结构的紧密集成,在非常有效的检索过程中支持各种XML排序模型。实验表明,对于几百MB的大型语料库,它比单独的内容/结构索引要好两个数量级以上。
{"title":"Content and structure in indexing and ranking XML","authors":"Felix Weigel, H. Meuss, K. Schulz, François Bry","doi":"10.1145/1017074.1017092","DOIUrl":"https://doi.org/10.1145/1017074.1017092","url":null,"abstract":"Rooted in electronic publishing, XML is now widely used for modelling and storing structured text documents. Especially in the WWW, retrieval of XML documents is most useful in combination with a relevance-based ranking of the query result. Index structures with ranking support are therefore needed for fast access to relevant parts of large document collections. This paper proposes a classification scheme for both XML ranking models and index structures, allowing to determine which index suits which ranking model. An analysis reveals that ranking parameters related to both the content and structure of the data are poorly supported by most known XML indices. The IR-CADG index, owing to its tight integration of content and structure, supports various XML ranking models in a very efficient retrieval process. Experiments show that it outperforms separate content/structure indexing by more than two orders of magnitude for large corpora of several hundred MB.","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":"3 1","pages":"67-72"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76103988","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}
引用次数: 36
Mining approximate functional dependencies and concept similarities to answer imprecise queries 挖掘近似的功能依赖关系和概念相似性来回答不精确的查询
Ullas Nambiar, S. Kambhampati
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we focus on providing a domain and end-user independent solution for supporting imprecise queries over Web databases without affecting the underlying database. We propose a query processing framework that integrates techniques from IR and database research to efficiently determine answers for imprecise queries. We mine and use approximate functional dependencies between attributes to create precise queries having tuples relevant to the given imprecise query. An approach to automatically estimate the semantic distances between values of categorical attributes is also proposed. We provide preliminary results showing the utility of our approach.
当前回答带有不精确约束的查询的方法要求用户提供感兴趣属性的距离度量和重要性度量。在本文中,我们专注于提供一个独立于域和最终用户的解决方案,以支持对Web数据库的不精确查询,而不会影响底层数据库。我们提出了一个查询处理框架,该框架集成了IR和数据库研究的技术,可以有效地确定不精确查询的答案。我们挖掘并使用属性之间的近似功能依赖关系来创建具有与给定的不精确查询相关的元组的精确查询。提出了一种自动估计分类属性值之间语义距离的方法。我们提供的初步结果显示了我们的方法的实用性。
{"title":"Mining approximate functional dependencies and concept similarities to answer imprecise queries","authors":"Ullas Nambiar, S. Kambhampati","doi":"10.1145/1017074.1017093","DOIUrl":"https://doi.org/10.1145/1017074.1017093","url":null,"abstract":"Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we focus on providing a domain and end-user independent solution for supporting imprecise queries over Web databases without affecting the underlying database. We propose a query processing framework that integrates techniques from IR and database research to efficiently determine answers for imprecise queries. We mine and use approximate functional dependencies between attributes to create precise queries having tuples relevant to the given imprecise query. An approach to automatically estimate the semantic distances between values of categorical attributes is also proposed. We provide preliminary results showing the utility of our approach.","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":"43 1","pages":"73-78"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79192736","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}
引用次数: 56
Querying peer-to-peer networks using P-trees 使用p树查询对等网络
Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
我们提出了一种新的分布式、容错对等索引结构,称为p树。p树除了计算相等查询外,还有效地计算范围查询。
{"title":"Querying peer-to-peer networks using P-trees","authors":"Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram","doi":"10.1145/1017074.1017082","DOIUrl":"https://doi.org/10.1145/1017074.1017082","url":null,"abstract":"We propose a new distributed, fault-tolerant peer-to-peer index structure called the <B>P-tree</B>. P-trees efficiently evaluate range queries in addition to equality 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":"53 1","pages":"25-30"},"PeriodicalIF":0.0,"publicationDate":"2004-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83272429","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}
引用次数: 175
Adaptive WebView Materialization 自适应WebView物化
Alexandros Labrinidis, N. Roussopoulos
Dynamic content generation poses huge resource demands on web servers, creating a scalability problem. WebView Materialization, where web pages are cached and constantly refreshed in the background, has been shown to ameliorate the scalability problem without sacrificing data freshness. In this work we present an adaptive online algorithm to select which WebViews to materialize, that realizes the trade-off between Quality of Service and Quality of Data. Our algorithm performs very close to the static, off-line optimal algorithm, and, under rapid workload changes, it outperforms the optimal.
动态内容生成对web服务器提出了巨大的资源需求,造成了可伸缩性问题。WebView物质化,网页被缓存并在后台不断刷新,已经被证明可以在不牺牲数据新鲜度的情况下改善可伸缩性问题。在这项工作中,我们提出了一种自适应在线算法来选择要实现的webview,实现了服务质量和数据质量之间的权衡。我们的算法的性能非常接近静态的离线最优算法,并且在快速工作负载变化下,它的性能优于最优算法。
{"title":"Adaptive WebView Materialization","authors":"Alexandros Labrinidis, N. Roussopoulos","doi":"10.21236/ada439848","DOIUrl":"https://doi.org/10.21236/ada439848","url":null,"abstract":"Dynamic content generation poses huge resource demands on web servers, creating a scalability problem. WebView Materialization, where web pages are cached and constantly refreshed in the background, has been shown to ameliorate the scalability problem without sacrificing data freshness. In this work we present an adaptive online algorithm to select which WebViews to materialize, that realizes the trade-off between Quality of Service and Quality of Data. Our algorithm performs very close to the static, off-line optimal algorithm, and, under rapid workload changes, it outperforms the optimal.","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":"85-90"},"PeriodicalIF":0.0,"publicationDate":"2001-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90088596","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}
引用次数: 28
Efficient Relational Storage and Retrieval of XML Documents XML文档的高效关系存储和检索
A. Schmidt, M. Kersten, Menzo Windhouwer, F. Waas
{"title":"Efficient Relational Storage and Retrieval of XML Documents","authors":"A. Schmidt, M. Kersten, Menzo Windhouwer, F. Waas","doi":"10.1007/3-540-45271-0_9","DOIUrl":"https://doi.org/10.1007/3-540-45271-0_9","url":null,"abstract":"","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":"31 1","pages":"137-150"},"PeriodicalIF":0.0,"publicationDate":"2000-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85204354","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}
引用次数: 253
Modeling Data Entry and Operations in WebML WebML中的数据输入和操作建模
Aldo Bongio, S. Ceri, P. Fraternali, A. Maurino
{"title":"Modeling Data Entry and Operations in WebML","authors":"Aldo Bongio, S. Ceri, P. Fraternali, A. Maurino","doi":"10.1007/3-540-45271-0_13","DOIUrl":"https://doi.org/10.1007/3-540-45271-0_13","url":null,"abstract":"","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":"27 1","pages":"87-92"},"PeriodicalIF":0.0,"publicationDate":"2000-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87707553","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}
引用次数: 50
XDuce: A Typed XML Processing Language (Preliminary Report) 一种类型化的XML处理语言(初步报告)
H. Hosoya, B. Pierce
{"title":"XDuce: A Typed XML Processing Language (Preliminary Report)","authors":"H. Hosoya, B. Pierce","doi":"10.1007/3-540-45271-0_15","DOIUrl":"https://doi.org/10.1007/3-540-45271-0_15","url":null,"abstract":"","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":"31 1","pages":"226-244"},"PeriodicalIF":0.0,"publicationDate":"2000-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74949608","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}
引用次数: 254
Active Query Caching for Database Web Servers 数据库Web服务器的主动查询缓存
Qiong Luo, J. Naughton, R. Krishnamurthy, P. Cao, Yunrui Li
{"title":"Active Query Caching for Database Web Servers","authors":"Qiong Luo, J. Naughton, R. Krishnamurthy, P. Cao, Yunrui Li","doi":"10.1007/3-540-45271-0_6","DOIUrl":"https://doi.org/10.1007/3-540-45271-0_6","url":null,"abstract":"","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":"57 4 1","pages":"29-34"},"PeriodicalIF":0.0,"publicationDate":"2000-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89736103","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}
引用次数: 89
Quilt: An XML Query Language for Heterogeneous Data Sources 一种异构数据源的XML查询语言
D. Chamberlin, J. Robie, D. Florescu
{"title":"Quilt: An XML Query Language for Heterogeneous Data Sources","authors":"D. Chamberlin, J. Robie, D. Florescu","doi":"10.1007/3-540-45271-0_1","DOIUrl":"https://doi.org/10.1007/3-540-45271-0_1","url":null,"abstract":"","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":"1 1","pages":"53-62"},"PeriodicalIF":0.0,"publicationDate":"2000-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84076474","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}
引用次数: 475
期刊
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