首页 > 最新文献

ACM SIGMOD Record最新文献

英文 中文
Database Education at UC San Diego 加州大学圣地亚哥分校的数据库教育
Pub Date : 2022-11-21 DOI: 10.1145/3572751.3572763
Arun C. S. Kumar, Alin Deutsch, Amarnath Gupta, Y. Papakonstantinou, Babak Salimi, V. Vianu
We are in the golden age of data-intensive computing. CS is now the largest major in most US universities. Data Science, ML/AI, and cloud computing have been growing rapidly. Many new data-centric job categories are taking shape in industry, e.g., data scientists, ML engineers, analytics engineers, and data associates. The DB/data management/data systems area is naturally a central part of all these transformations. Thus, the DB community must keep evolving and innovating to fulfill the need for DB education in all its facets, including its intersection with other areas such as ML, systems, HCI, various domain sciences, etc., as well as bridging the gap with practice and industry.
我们正处于数据密集型计算的黄金时代。计算机科学现在是大多数美国大学最大的专业。数据科学、ML/AI和云计算发展迅速。许多新的以数据为中心的工作类别正在行业中形成,例如数据科学家、机器学习工程师、分析工程师和数据助理。数据库/数据管理/数据系统领域自然是所有这些转换的中心部分。因此,数据库社区必须不断发展和创新,以满足数据库教育在各个方面的需求,包括与ML、系统、HCI、各种领域科学等其他领域的交叉,并弥合与实践和行业的差距。
{"title":"Database Education at UC San Diego","authors":"Arun C. S. Kumar, Alin Deutsch, Amarnath Gupta, Y. Papakonstantinou, Babak Salimi, V. Vianu","doi":"10.1145/3572751.3572763","DOIUrl":"https://doi.org/10.1145/3572751.3572763","url":null,"abstract":"We are in the golden age of data-intensive computing. CS is now the largest major in most US universities. Data Science, ML/AI, and cloud computing have been growing rapidly. Many new data-centric job categories are taking shape in industry, e.g., data scientists, ML engineers, analytics engineers, and data associates. The DB/data management/data systems area is naturally a central part of all these transformations. Thus, the DB community must keep evolving and innovating to fulfill the need for DB education in all its facets, including its intersection with other areas such as ML, systems, HCI, various domain sciences, etc., as well as bridging the gap with practice and industry.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134329639","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
Revisiting Online Data Markets in 2022 2022年重新审视在线数据市场
Pub Date : 2022-11-21 DOI: 10.1145/3572751.3572757
Javen Kennedy, Pranav Subramaniam, Sainyam Galhotra, Raul Castro Fernandez
Well-functioning data markets match sellers with buyers to allocate data effectively. Although most of today's data markets fall short of this ideal, there is a renewed interest in online data marketplaces that may fulfill the promise of data markets. In this paper, we survey participants of some of the most common data marketplaces to understand the platforms' upsides and downsides. We find that buyers and sellers spend the majority of their time and effort in price negotiations. Although the markets work as an effective storefront that lets buyers find useful data fast, the high transaction costs required to negotiate price and circumvent the information asymmetry that exists between buyers and sellers indicates that today's marketplaces are still far from offering an effective solution to data trading. We draw on the results of the interviews to present potential opportunities for improvement and future research.
运作良好的数据市场将卖家和买家匹配起来,有效地分配数据。尽管今天的大多数数据市场都达不到这一理想,但人们对在线数据市场重新产生了兴趣,这可能会实现数据市场的承诺。在本文中,我们调查了一些最常见的数据市场的参与者,以了解平台的优点和缺点。我们发现买卖双方把大部分时间和精力都花在价格谈判上。尽管市场是一个有效的店面,可以让买家快速找到有用的数据,但谈判价格和规避买家和卖家之间存在的信息不对称所需的高交易成本表明,今天的市场还远远不能为数据交易提供有效的解决方案。我们利用访谈的结果来提出改进和未来研究的潜在机会。
{"title":"Revisiting Online Data Markets in 2022","authors":"Javen Kennedy, Pranav Subramaniam, Sainyam Galhotra, Raul Castro Fernandez","doi":"10.1145/3572751.3572757","DOIUrl":"https://doi.org/10.1145/3572751.3572757","url":null,"abstract":"Well-functioning data markets match sellers with buyers to allocate data effectively. Although most of today's data markets fall short of this ideal, there is a renewed interest in online data marketplaces that may fulfill the promise of data markets. In this paper, we survey participants of some of the most common data marketplaces to understand the platforms' upsides and downsides. We find that buyers and sellers spend the majority of their time and effort in price negotiations. Although the markets work as an effective storefront that lets buyers find useful data fast, the high transaction costs required to negotiate price and circumvent the information asymmetry that exists between buyers and sellers indicates that today's marketplaces are still far from offering an effective solution to data trading. We draw on the results of the interviews to present potential opportunities for improvement and future research.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134163839","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
Characterizing I/O in Machine Learning with MLPerf Storage 用MLPerf Storage表征机器学习中的I/O
Pub Date : 2022-11-21 DOI: 10.1145/3572751.3572765
Oana Balmau
Data is the driving force behind machine learning (ML) algorithms. The way we ingest, store, and serve data can impact the performance of end-to-end training and inference significantly [11]. However, efficient storage and pre-processing of training data has received far less focus in ML compared to efforts in building specialized software frameworks and hardware accelerators. The amount of data that we produce is growing exponentially, making it expensive and difficult to keep entire training datasets in main memory. Increasingly, ML algorithms will need to access data from persistent storage in an efficient way.
数据是机器学习算法背后的驱动力。我们摄取、存储和提供数据的方式会显著影响端到端训练和推理的性能[11]。然而,与构建专门的软件框架和硬件加速器相比,高效存储和预处理训练数据在ML中受到的关注要少得多。我们产生的数据量呈指数级增长,这使得将整个训练数据集保存在主内存中变得昂贵和困难。ML算法将越来越需要以有效的方式从持久存储中访问数据。
{"title":"Characterizing I/O in Machine Learning with MLPerf Storage","authors":"Oana Balmau","doi":"10.1145/3572751.3572765","DOIUrl":"https://doi.org/10.1145/3572751.3572765","url":null,"abstract":"Data is the driving force behind machine learning (ML) algorithms. The way we ingest, store, and serve data can impact the performance of end-to-end training and inference significantly [11]. However, efficient storage and pre-processing of training data has received far less focus in ML compared to efforts in building specialized software frameworks and hardware accelerators. The amount of data that we produce is growing exponentially, making it expensive and difficult to keep entire training datasets in main memory. Increasingly, ML algorithms will need to access data from persistent storage in an efficient way.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124004908","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
Management of Implicit Requirements Data in Large SRS Documents 大型SRS文档中隐含需求数据的管理
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552494
Dev Dave, Angeli Celestino, A. Varde, Vaibhav Anu
Implicit Requirements (IMR) identification is part of the Requirements Engineering (RE) phase in Software Engineering during which data is gathered to create SRS (Software Requirements Specifications) documents. As opposed to explicit requirements clearly stated, IMRs constitute subtle data and need to be inferred. Research has shown that IMRs are crucial to the success of software development. Many software systems can encounter failures due to lack of IMR data management. SRS documents are large, often hundreds of pages, due to which manually identifying IMRs by human software engineers is not feasible. Moreover, such data is evergrowing due to the expansion of software systems. It is thus important to address the crucial issue of IMR data management. This article presents a survey on IMRs in SRS documents with the definition and overview of IMR data, detailed taxonomy of IMRs with explanation and examples, practices in managing IMR data, and tools for IMR identification. In addition to reviewing classical and state-of-the-art approaches, we highlight trends and challenges and point out open issues for future research. This survey article is interesting based on data quality, hidden information retrieval, veracity and salience, and knowledge discovery from large textual documents with complex heterogeneous data.
隐式需求(IMR)识别是软件工程中需求工程(RE)阶段的一部分,在此阶段收集数据以创建SRS(软件需求规范)文档。与明确说明的明确需求相反,imr构成了微妙的数据,需要推断。研究表明,imr对软件开发的成功至关重要。由于缺乏IMR数据管理,许多软件系统可能会遇到故障。SRS文档很大,通常有数百页,因此由人类软件工程师手动识别imr是不可行的。此外,由于软件系统的扩展,这些数据正在不断增长。因此,必须解决IMR数据管理这一关键问题。本文对SRS文档中的IMR进行了调查,包括IMR数据的定义和概述、IMR的详细分类(包括解释和示例)、管理IMR数据的实践以及识别IMR的工具。除了回顾经典和最新的方法外,我们还强调了趋势和挑战,并指出了未来研究的开放性问题。本文从数据质量、隐藏信息检索、准确性和显著性、知识发现等方面对具有复杂异构数据的大型文本文档进行了研究。
{"title":"Management of Implicit Requirements Data in Large SRS Documents","authors":"Dev Dave, Angeli Celestino, A. Varde, Vaibhav Anu","doi":"10.1145/3552490.3552494","DOIUrl":"https://doi.org/10.1145/3552490.3552494","url":null,"abstract":"Implicit Requirements (IMR) identification is part of the Requirements Engineering (RE) phase in Software Engineering during which data is gathered to create SRS (Software Requirements Specifications) documents. As opposed to explicit requirements clearly stated, IMRs constitute subtle data and need to be inferred. Research has shown that IMRs are crucial to the success of software development. Many software systems can encounter failures due to lack of IMR data management. SRS documents are large, often hundreds of pages, due to which manually identifying IMRs by human software engineers is not feasible. Moreover, such data is evergrowing due to the expansion of software systems. It is thus important to address the crucial issue of IMR data management. This article presents a survey on IMRs in SRS documents with the definition and overview of IMR data, detailed taxonomy of IMRs with explanation and examples, practices in managing IMR data, and tools for IMR identification. In addition to reviewing classical and state-of-the-art approaches, we highlight trends and challenges and point out open issues for future research. This survey article is interesting based on data quality, hidden information retrieval, veracity and salience, and knowledge discovery from large textual documents with complex heterogeneous data.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129075920","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
A Case for Enrichment in Data Management Systems 数据管理系统的丰富案例
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552497
Dhrubajyoti Ghosh, Peeyush Gupta, S. Mehrotra, Shantanu Sharma
We describe ENRICHDB, a new DBMS technology designed for emerging domains (e.g., sensor-driven smart spaces and social media analytics) that require incoming data to be enriched using expensive functions prior to its usage. To support online processing, today, such enrichment is performed outside of DBMSs, as a static data processing workflow prior to its ingestion into a DBMS. Such a strategy could result in a significant delay from the time when data arrives and when it is enriched and ingested into the DBMS, especially when the enrichment complexity is high. Also, enriching at ingestion could result in wastage of resources if applications do not use/require all data to be enriched. ENRICHDB's design represents a significant departure from the above, where we explore seamless integration of data enrichment all through the data processing pipeline - at ingestion, triggered based on events in the background, and progressively during query processing. The cornerstone of ENRICHDB is a powerful enrichment data and query model that encapsulates enrichment as an operator inside a DBMS enabling it to co-optimize enrichment with query processing. This paper describes this data model and provides a summary of the system implementation.
我们描述了一种新的DBMS技术,为新兴领域(例如,传感器驱动的智能空间和社交媒体分析)而设计,这些领域需要在使用之前使用昂贵的功能来丰富传入数据。为了支持在线处理,如今,这种丰富是在DBMS之外执行的,作为静态数据处理工作流,然后将其摄取到DBMS中。这样的策略可能会导致从数据到达到数据被充实并被摄取到DBMS中的时间的显著延迟,特别是当充实的复杂性很高时。此外,如果应用程序不使用/不需要对所有数据进行富集,则在摄取时进行富集可能会导致资源浪费。enrichment db的设计与上面的设计有很大的不同,我们通过数据处理管道探索数据丰富的无缝集成——在摄取时,基于后台事件触发,并在查询处理期间逐步触发。浓缩数据库的基石是一个强大的浓缩数据和查询模型,它将浓缩作为一个操作符封装在DBMS中,使其能够与查询处理共同优化浓缩。本文描述了该数据模型,并对系统的实现进行了总结。
{"title":"A Case for Enrichment in Data Management Systems","authors":"Dhrubajyoti Ghosh, Peeyush Gupta, S. Mehrotra, Shantanu Sharma","doi":"10.1145/3552490.3552497","DOIUrl":"https://doi.org/10.1145/3552490.3552497","url":null,"abstract":"We describe ENRICHDB, a new DBMS technology designed for emerging domains (e.g., sensor-driven smart spaces and social media analytics) that require incoming data to be enriched using expensive functions prior to its usage. To support online processing, today, such enrichment is performed outside of DBMSs, as a static data processing workflow prior to its ingestion into a DBMS. Such a strategy could result in a significant delay from the time when data arrives and when it is enriched and ingested into the DBMS, especially when the enrichment complexity is high. Also, enriching at ingestion could result in wastage of resources if applications do not use/require all data to be enriched. ENRICHDB's design represents a significant departure from the above, where we explore seamless integration of data enrichment all through the data processing pipeline - at ingestion, triggered based on events in the background, and progressively during query processing. The cornerstone of ENRICHDB is a powerful enrichment data and query model that encapsulates enrichment as an operator inside a DBMS enabling it to co-optimize enrichment with query processing. This paper describes this data model and provides a summary of the system implementation.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123699103","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
Datalog in Wonderland 《漫游仙境
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552492
Mahmoud Abo Khamis, RelationalAI, H. Ngo, R. Pichler, T. Wien, Dan Suciu
Modern data analytics applications, such as knowledge graph reasoning and machine learning, typically involve recursion through aggregation. Such computations pose great challenges to both system builders and theoreticians: first, to derive simple yet powerful abstractions for these computations; second, to define and study the semantics for the abstractions; third, to devise optimization techniques for these computations. In recent work we presented a generalization of Datalog called Datalog, which addresses these challenges. Datalog is a simple abstraction, which allows aggregates to be interleaved with recursion, and retains much of the simplicity and elegance of Datalog. We define its formal semantics based on an algebraic structure called Partially Ordered Pre-Semirings, and illustrate through several examples how Datalog can be used for a variety of applications. Finally, we describe a new optimization rule for Datalog, called the FGH-rule, then illustrate the FGH-rule on several examples, including a simple magic-set rewriting, generalized semi-naïve evaluation, and a bill-of-material example, and briefly discuss the implementation of the FGH-rule and present some experimental validation of its effectiveness.
现代数据分析应用程序,如知识图推理和机器学习,通常涉及通过聚合的递归。这样的计算对系统构建者和理论家都提出了巨大的挑战:首先,为这些计算推导出简单而强大的抽象;第二,对抽象的语义进行定义和研究;第三,为这些计算设计优化技术。在最近的工作中,我们提出了Datalog的泛化,称为Datalog,它解决了这些挑战。Datalog是一个简单的抽象,它允许聚合与递归交织在一起,并保留了Datalog的许多简单性和优雅性。我们基于称为部分有序预半环的代数结构定义其形式语义,并通过几个示例说明如何将Datalog用于各种应用程序。最后,我们描述了一种新的Datalog优化规则,称为fgh规则,然后在几个例子上说明了fgh规则,包括一个简单的magic-set重写,广义semi-naïve评估和一个物料清单示例,并简要讨论了fgh规则的实现,并给出了一些实验验证其有效性。
{"title":"Datalog in Wonderland","authors":"Mahmoud Abo Khamis, RelationalAI, H. Ngo, R. Pichler, T. Wien, Dan Suciu","doi":"10.1145/3552490.3552492","DOIUrl":"https://doi.org/10.1145/3552490.3552492","url":null,"abstract":"Modern data analytics applications, such as knowledge graph reasoning and machine learning, typically involve recursion through aggregation. Such computations pose great challenges to both system builders and theoreticians: first, to derive simple yet powerful abstractions for these computations; second, to define and study the semantics for the abstractions; third, to devise optimization techniques for these computations. In recent work we presented a generalization of Datalog called Datalog, which addresses these challenges. Datalog is a simple abstraction, which allows aggregates to be interleaved with recursion, and retains much of the simplicity and elegance of Datalog. We define its formal semantics based on an algebraic structure called Partially Ordered Pre-Semirings, and illustrate through several examples how Datalog can be used for a variety of applications. Finally, we describe a new optimization rule for Datalog, called the FGH-rule, then illustrate the FGH-rule on several examples, including a simple magic-set rewriting, generalized semi-naïve evaluation, and a bill-of-material example, and briefly discuss the implementation of the FGH-rule and present some experimental validation of its effectiveness.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122118382","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
Diversity and Inclusion Activities in Database Conferences 数据库会议中的多样性和包容性活动
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552510
S. Amer-Yahia, Yael Amsterdamer, S. Bhowmick, A. Bonifati, Philippe Bonnet, Renata Borovica-Gajic, Barbara Catania, T. Cerquitelli, S. Chiusano, Panos K. Chrysanthis, C. Curino, J. Darmont, A. El Abbadi, A. Floratou, Juliana Freire, Alekh Jindal, V. Kalogeraki, G. Koutrika, Arun Kumar, Sujaya Maiyya, A. Meliou, Madhulika Mohanty, Felix Naumann, N. Noack, Fatma Özcan, L. Peterfreund, W. Rahayu, Wang-Chiew Tan, Yuan Tian, Pınar Tözün, Genoveva Vargas-Solar, N. Yadwadkar, Meihui Zhang
Diversity and Inclusion (D&I) are core to fostering innovative thinking. Existing theories demonstrate that to facilitate inclusion, multiple types of exclusionary dynamics, such as self-segregation, communication apprehension, and stereotyping and stigmatizing, must be overcome [11]. A diverse group of people tends to surface different perspectives, which help to understand and address D&I. Fostering D&I in research communities must address issues related to inclusive interpersonal and small group dynamics, rules and codes of conduct, increasing diversity in under-represented groups and disciplines, and organizing D&I events, and longterm efforts to champion change [15].
多样性和包容性(D&I)是培养创新思维的核心。现有理论表明,为了促进包容,必须克服多种类型的排斥动力,如自我隔离、沟通恐惧、刻板印象和污名化[11]。一个多样化的群体往往会呈现出不同的观点,这有助于理解和处理D&I。在研究界培养D&I必须解决与包容性人际关系和小群体动态、规则和行为准则、增加代表性不足的群体和学科的多样性、组织D&I活动以及支持变革的长期努力相关的问题[15]。
{"title":"Diversity and Inclusion Activities in Database Conferences","authors":"S. Amer-Yahia, Yael Amsterdamer, S. Bhowmick, A. Bonifati, Philippe Bonnet, Renata Borovica-Gajic, Barbara Catania, T. Cerquitelli, S. Chiusano, Panos K. Chrysanthis, C. Curino, J. Darmont, A. El Abbadi, A. Floratou, Juliana Freire, Alekh Jindal, V. Kalogeraki, G. Koutrika, Arun Kumar, Sujaya Maiyya, A. Meliou, Madhulika Mohanty, Felix Naumann, N. Noack, Fatma Özcan, L. Peterfreund, W. Rahayu, Wang-Chiew Tan, Yuan Tian, Pınar Tözün, Genoveva Vargas-Solar, N. Yadwadkar, Meihui Zhang","doi":"10.1145/3552490.3552510","DOIUrl":"https://doi.org/10.1145/3552490.3552510","url":null,"abstract":"Diversity and Inclusion (D&I) are core to fostering innovative thinking. Existing theories demonstrate that to facilitate inclusion, multiple types of exclusionary dynamics, such as self-segregation, communication apprehension, and stereotyping and stigmatizing, must be overcome [11]. A diverse group of people tends to surface different perspectives, which help to understand and address D&I. Fostering D&I in research communities must address issues related to inclusive interpersonal and small group dynamics, rules and codes of conduct, increasing diversity in under-represented groups and disciplines, and organizing D&I events, and longterm efforts to champion change [15].","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133775972","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
Teaching about Data and Databases 数据和数据库教学
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552504
A. Fekete, Uwe Röhm
The panel on data(base) education at VLDB2021 [13] drew attention to important challenges in choosing how database classes are constructed for students in a world where data is being used in novel and impactful settings. This paper aims to present one view of a process for making these pedagogy decisions. We don't aim to present a best-possible design of the subject, rather we want to illuminate the space of possibilities, to encourage reasoned choices rather than simply teaching the subject as it was previously offered, or spending time on the latest innovations without considering the "opportunity cost" of doing so. We hope to guide the perplexed instructor or departmental curriculum committee.
VLDB2021[13]的数据(基础)教育小组提请注意,在数据被用于新颖和有影响力的环境的世界中,如何为学生选择数据库课程的重要挑战。本文的目的是提出一个过程的观点,使这些教学决策。我们的目标并不是呈现一个最佳的主题设计,而是我们想要照亮可能性的空间,鼓励理性的选择,而不是简单地像以前提供的那样教授主题,或者花时间在最新的创新上而不考虑这样做的“机会成本”。我们希望能给困惑的导师或院系课程委员会一些指导。
{"title":"Teaching about Data and Databases","authors":"A. Fekete, Uwe Röhm","doi":"10.1145/3552490.3552504","DOIUrl":"https://doi.org/10.1145/3552490.3552504","url":null,"abstract":"The panel on data(base) education at VLDB2021 [13] drew attention to important challenges in choosing how database classes are constructed for students in a world where data is being used in novel and impactful settings. This paper aims to present one view of a process for making these pedagogy decisions. We don't aim to present a best-possible design of the subject, rather we want to illuminate the space of possibilities, to encourage reasoned choices rather than simply teaching the subject as it was previously offered, or spending time on the latest innovations without considering the \"opportunity cost\" of doing so. We hope to guide the perplexed instructor or departmental curriculum committee.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133614410","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
Artifacts Availability & Reproducibility (VLDB 2021 Round Table) 文物的可用性和再现性(VLDB 2021圆桌会议)
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552511
Manos Athanassoulis, P. Triantafillou, Raja Appuswamy, R. Bordawekar, B. Chandramouli, Xuntao Cheng, I. Manolescu, Y. Papakonstantinou, Nesime Tatbul
In the last few years, SIGMOD and VLDB have intensified efforts to encourage, facilitate, and establish reproducibility as a key process for accepted research papers, awarding them with the Reproducibility badge. In addition, complementary efforts have focused on increasing the sharing of accompanying artifacts of published work (code, scripts, data), independently of reproducibility, awarding them the Artifacts Available badge. In this short note, we summarize the discussion of a panel held during VLDB 2021 titled "Artifacts, Availability & Reproducibility". We first present a more detailed summary of the recent efforts. Then, we present the discussion and the contributed key points that were made, aiming to assess the reproducibility of data management research and to propose changes moving forward.
在过去几年中,SIGMOD和VLDB加强了鼓励、促进和建立可重复性的努力,将其作为被接受的研究论文的关键过程,并授予他们可重复性徽章。此外,补充性的工作集中于增加已发布工作(代码、脚本、数据)的伴随工件的共享,独立于可再现性,授予它们工件可用标记。在这篇短文中,我们总结了在VLDB 2021期间举行的题为“工件,可用性和可再现性”的小组讨论。我们首先对最近的努力作一个更详细的总结。然后,我们介绍了讨论和贡献的关键点,旨在评估数据管理研究的可重复性,并提出了向前发展的变化。
{"title":"Artifacts Availability & Reproducibility (VLDB 2021 Round Table)","authors":"Manos Athanassoulis, P. Triantafillou, Raja Appuswamy, R. Bordawekar, B. Chandramouli, Xuntao Cheng, I. Manolescu, Y. Papakonstantinou, Nesime Tatbul","doi":"10.1145/3552490.3552511","DOIUrl":"https://doi.org/10.1145/3552490.3552511","url":null,"abstract":"In the last few years, SIGMOD and VLDB have intensified efforts to encourage, facilitate, and establish reproducibility as a key process for accepted research papers, awarding them with the Reproducibility badge. In addition, complementary efforts have focused on increasing the sharing of accompanying artifacts of published work (code, scripts, data), independently of reproducibility, awarding them the Artifacts Available badge. In this short note, we summarize the discussion of a panel held during VLDB 2021 titled \"Artifacts, Availability & Reproducibility\". We first present a more detailed summary of the recent efforts. Then, we present the discussion and the contributed key points that were made, aiming to assess the reproducibility of data management research and to propose changes moving forward.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126336461","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
The Social Technology and Research (STAR) Lab in the University of Hong Kong 香港大学社会科技及研究(STAR)实验室
Pub Date : 2022-07-29 DOI: 10.1145/3552490.3552508
Reynold Cheng, Chenhao Ma, Xiaodong Li, Yixiang Fang, Ye Liu, Victor Y.L. Wong, Esther Lee, T. Lam, S. Ho, M. Wang, Weijie Gong, Wentao Ning, B. Kao
The main goal of the Social Technology and Research Laboratory (STAR Lab) in the University of Hong Kong (https://star.hku.hk) is to develop novel IT technologies for serving the society. Our team has more than three years of experience in project development, web, app, and game design, photography, and video production. We are interested in?Data Science for Social Good", researching data-driven approaches that can benefit the public, NGOs, and the government.
香港大学社会科技及研究实验室(https://star.hku.hk)的主要目标是开发新的资讯科技,为社会服务。我们的团队在项目开发,网页,应用程序和游戏设计,摄影和视频制作方面拥有超过三年的经验。我们感兴趣的是什么?“数据科学造福社会”,研究数据驱动的方法,使公众、非政府组织和政府受益。
{"title":"The Social Technology and Research (STAR) Lab in the University of Hong Kong","authors":"Reynold Cheng, Chenhao Ma, Xiaodong Li, Yixiang Fang, Ye Liu, Victor Y.L. Wong, Esther Lee, T. Lam, S. Ho, M. Wang, Weijie Gong, Wentao Ning, B. Kao","doi":"10.1145/3552490.3552508","DOIUrl":"https://doi.org/10.1145/3552490.3552508","url":null,"abstract":"The main goal of the Social Technology and Research Laboratory (STAR Lab) in the University of Hong Kong (https://star.hku.hk) is to develop novel IT technologies for serving the society. Our team has more than three years of experience in project development, web, app, and game design, photography, and video production. We are interested in?Data Science for Social Good\", researching data-driven approaches that can benefit the public, NGOs, and the government.","PeriodicalId":346332,"journal":{"name":"ACM SIGMOD Record","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117040015","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
期刊
ACM SIGMOD Record
全部 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