Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Meiyu Lu

dblp:93/7784 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 7 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
7 papers
Query processing and optimization · 39% Data integration and cleaning · 29% Knowledge graphs · 10%
Software engineering, system software, and programming languages
1 paper
Empirical software engineering · 100%

Topics — the 10 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
cost-based optimization
0.522016
CrowdOp: Query optimization for declarative crowdsourcing systems · ICDE 2016
CrowdOp: Query Optimization for Declarative Crowdsourcing Systems · IEEE Trans. Knowl. Data Eng. 2015
Data integration and cleaning
schema matching
0.322014
A hybrid machine-crowdsourcing system for matching web tables · ICDE 2014
Schema-as-you-go: on probabilistic tagging and querying of wide tables · SIGMOD Conference 2011
Information retrieval › search engines
dataset search
0.112012
A Dataset Search Engine for the Research Document Corpus · ICDE 2012
Empirical software engineering
crowdsourcing
0.112012
CDAS: A Crowdsourcing Data Analytics System · Proc. VLDB Endow. 2012
Data integration and cleaning › semantic integration
ontology-based data integration
0.112011
A cross-service travel engine for trip planning · SIGMOD Conference 2011
Data models and query languages
query interface
0.112011
Schema-as-you-go: on probabilistic tagging and querying of wide tables · SIGMOD Conference 2011
Data integration and cleaning
crowdsourced data processing
0.112015
CrowdOp: Query Optimization for Declarative Crowdsourcing Systems · IEEE Trans. Knowl. Data Eng. 2015
Collaborative and social computing
crowdsourcing
0.112014
A hybrid machine-crowdsourcing system for matching web tables · ICDE 2014
Smart cities and intelligent transportation
trip planning
0.012011
A cross-service travel engine for trip planning · SIGMOD Conference 2011
Data integration and cleaning › mediator systems
mediated schema
0.012011
Schema-as-you-go: on probabilistic tagging and querying of wide tables · SIGMOD Conference 2011

Methods — techniques the papers use, named apart from their topics

crowdsourcing · 0.4concept-based matching · 0.4budget allocation · 0.4quality estimation · 0.3online verification · 0.3query plan generation · 0.2cost-latency trade-off · 0.2simulation · 0.2crowdsourcing experiments · 0.2cost-based optimization · 0.2visualization · 0.1geographical ontology · 0.1
YearPublicationVenuePosition
2016 CrowdOp: Query optimization for declarative crowdsourcing systems
abstract
We propose CROWDOP, a cost-based query optimization approach for declarative crowdsourcing systems. CROWDOP considers both cost and latency in the query optimization objectives and generates query plans that provide a good balance between the cost and latency. We develop efficient algorithms in CROWDOP for optimizing three types of queries: selection, join and complex selection-join queries. We validate our approach via extensive experiments by simulation as well as with the real crowd on Amazon Mechanical Turk.
Ju Fan, Meihui Zhang 0001, Stanley Kok, Meiyu Lu, Beng Chin Ooi
ICDE4
2015 CrowdOp: Query Optimization for Declarative Crowdsourcing Systems
abstract
We study the query optimization problem in declarative crowdsourcing systems. Declarative crowdsourcing is designed to hide the complexities and relieve the user of the burden of dealing with the crowd. The user is only required to submit an SQL-like query and the system takes the responsibility of compiling the query, generating the execution plan and evaluating in the crowdsourcing marketplace. A given query can have many alternative execution plans and the difference in crowdsourcing cost between the best and the worst plans may be several orders of magnitude. Therefore, as in relational database systems, query optimization is important to crowdsourcing systems that provide declarative query interfaces. In this paper, we proposeCrowdOp, a cost-based query optimization approach for declarative crowdsourcing systems.CrowdOpconsiders both cost and latency in query optimization objectives and generates query plans that provide a good balance between the cost and latency. We develop efficient algorithms in theCrowdOpfor optimizing three types of queries: selection queries, join queries, and complex selection-join queries. We validate our approach via extensive experiments by simulation as well as with the real crowd on Amazon Mechanical Turk.
Ju Fan, Meihui Zhang 0001, Stanley Kok, Meiyu Lu, Beng Chin Ooi
IEEE Trans. Knowl. Data Eng.4
2014 A hybrid machine-crowdsourcing system for matching web tables
abstract
The Web is teeming with rich structured information in the form of HTML tables, which provides us with the opportunity to build a knowledge repository by integrating these tables. An essential problem of web data integration is to discover semantic correspondences between web table columns, and schema matching is a popular means to determine the semantic correspondences. However, conventional schema matching techniques are not always effective for web table matching due to the incompleteness in web tables. In this paper, we propose a two-pronged approach for web table matching that effectively addresses the above difficulties. First, we propose a concept-based approach that maps each column of a web table to the best concept, in a well-developed knowledge base, that represents it. This approach overcomes the problem that sometimes values of two web table columns may be disjoint, even though the columns are related, due to incompleteness in the column values. Second, we develop a hybrid machine-crowdsourcing framework that leverages human intelligence to discern the concepts for “difficult” columns. Our overall framework assigns the most “beneficial” column-to-concept matching tasks to the crowd under a given budget and utilizes the crowdsourcing result to help our algorithm infer the best matches for the rest of the columns. We validate the effectiveness of our framework through an extensive experimental study over two real-world web table data sets. The results show that our two-pronged approach outperforms existing schema matching techniques at only a low cost for crowdsourcing.
Ju Fan, Meiyu Lu, Beng Chin Ooi, Wang Chiew Tan, Meihui Zhang 0001
ICDE2
2012 A Dataset Search Engine for the Research Document Corpus
abstract
A key step in validating a proposed idea or system is to evaluate over a suitable dataset. However, to this date there have been no useful tools for researchers to understand which datasets have been used for what purpose, or in what prior work. Instead, they have to manually browse through papers to find the suitable datasets and their corresponding URLs, which is laborious and inefficient. To better aid the dataset discovery process, and provide a better understanding of how and where datasets have been used, we propose a framework to effectively identify datasets within the scientific corpus. The key technical challenges are identification of datasets, and discovery of the association between a dataset and the URLs where they can be accessed. Based on this, we have built a user friendly web-based search interface for users to conveniently explore the dataset-paper relationships, and find relevant datasets and their properties.
Meiyu Lu, Srinivas Bangalore, Graham Cormode, Marios Hadjieleftheriou, Divesh Srivastava
ICDE1
2012 CDAS: A Crowdsourcing Data Analytics System
abstract
Some complex problems, such as image tagging and natural language processing, are very challenging for computers, where even state-of-the-art technology is yet able to provide satisfactory accuracy. Therefore, rather than relying solely on developing new and better algorithms to handle such tasks, we look to the crowdsourcing solution -- employing human participation -- to make good the shortfall in current technology. Crowdsourcing is a good supplement to many computer tasks. A complex job may be divided into computer-oriented tasks and human-oriented tasks, which are then assigned to machines and humans respectively. To leverage the power of crowdsourcing, we design and implement a Crowdsourcing Data Analytics System, CDAS. CDAS is a framework designed to support the deployment of various crowdsourcing applications. The core part of CDAS is a quality-sensitive answering model, which guides the crowdsourcing engine to process and monitor the human tasks. In this paper, we introduce the principles of our quality-sensitive model. To satisfy user required accuracy, the model guides the crowdsourcing query engine for the design and processing of the corresponding crowdsourcing jobs. It provides an estimated accuracy for each generated result based on the human workers' historical performances. When verifying the quality of the result, the model employs an online strategy to reduce waiting time. To show the effectiveness of the model, we implement and deploy two analytics jobs on CDAS, a twitter sentiment analytics job and an image tagging job. We use real Twitter and Flickr data as our queries respectively. We compare our approaches with state-of-the-art classification and image annotation techniques. The results show that the human-assisted methods can indeed achieve a much higher accuracy. By embedding the quality-sensitive model into crowdsourcing query engine, we effectively reduce the processing cost while maintaining the required query answer quality.
Meiyu Lu, Beng Chin Ooi, Yanyan Shen, Sai Wu, Meihui Zhang 0001
Proc. VLDB Endow.2
2011 A cross-service travel engine for trip planning
abstract
The online travel services and resources are far from well organized and integrated. Trip planning is still a laborious job requiring interaction with a combination of services such as travel guides, personal travel blogs, map services and public transportation to piece together an itinerary. To facilitate this process, we have designed a cross-service travel engine for trip planners. Our system seamlessly and semantically integrates various types of travel services and resources based on a geographical ontology. We also built a user-friendly visualization tool for travellers to conveniently browse and design personal itineraries on Google Maps.
Gang Chen 0001, Meiyu Lu, Beng Chin Ooi, Shanshan Ying, Anthony K. H. Tung, Dongxiang Zhang, Meihui Zhang 0001
SIGMOD Conference3
2011 Schema-as-you-go: on probabilistic tagging and querying of wide tables
abstract
The emergence of Web 2.0 has resulted in a huge amount of heterogeneous data that are contributed by a large number of users, engendering new challenges for data management and query processing. Given that the data are unified from various sources and accessed by numerous users, providing users with a unified mediated schema as data integration is insufficient. On one hand, a deterministic mediated schema restricts users' freedom to express queries in their preferred vocabulary; on the other hand, it is not realistic for users to remember the numerous attribute names that arise from integrating various data sources. As such, a user-oriented data management and query interface is required.
Meiyu Lu, Divyakant Agrawal, Bing Tian Dai, Anthony K. H. Tung
SIGMOD Conference1