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.

Fan Yang 0002

dblp:y/FanYang2 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 9 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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
6 papers
Information retrieval · 36% Query processing and optimization · 32% Data models and query languages · 17%
Software engineering, system software, and programming languages
3 papers
Programming languages and type systems · 50% Services computing and microservices · 34% Program synthesis and code generation · 16%
Human-computer interaction and pervasive computing
2 papers
User interface design and tools · 100%

Topics — the 12 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › keyword query processing
keyword search over databases
0.112009
Efficient keyword search over virtual XML views · VLDB J. 2009
Information retrieval
keyword search
0.112007
Efficient Keyword Search over Virtual XML Views · VLDB 2007
Programming languages and type systems › programming paradigms
declarative programming
0.112007
A unified platform for data driven web applications with automatic client-server partitioning · WWW 2007
Information retrieval
retrieval models
0.112006
Quark: an efficient XQuery full-text implementation · SIGMOD Conference 2006
Information retrieval
search engines
0.112006
Quark: an efficient XQuery full-text implementation · SIGMOD Conference 2006
Information retrieval › document retrieval › structured document retrieval
XML search
0.112006
Quark: an efficient XQuery full-text implementation · SIGMOD Conference 2006
Programming languages and type systems
domain-specific languages
0.112006
Hilda: A High-Level Language for Data-DrivenWeb Applications · ICDE 2006
Programming languages and type systems › domain-specific languages
web programming language
0.112006
Hilda: A High-Level Language for Data-DrivenWeb Applications · ICDE 2006
Data models and query languages
XML data management
0.012009
Efficient keyword search over virtual XML views · VLDB J. 2009
Database system architecture and tuning › view management
XML views
0.012009
Efficient keyword search over virtual XML views · VLDB J. 2009
User interface design and tools
end-user programming
0.012008
WYSIWYG development of data driven web applications · Proc. VLDB Endow. 2008
Data models and query languages › data modeling
unified data model
0.012006
Hilda: A High-Level Language for Data-DrivenWeb Applications · ICDE 2006

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

graphical specification · 0.2automatic code generation · 0.2trace-based evaluation · 0.1runtime partitioning · 0.1declarative programming · 0.1conflict detection · 0.1
YearPublicationVenuePosition
2009 A Scalable Data Platform for a Large Number of Small Applications
Fan Yang 0002, Jayavel Shanmugasundaram, Ramana Yerneni
CIDR1
2009 Efficient keyword search over virtual XML views
Feng Shao 0002, Chavdar Botev, Anand Bhaskar, Muthiah Chettiar, Fan Yang 0002, Jayavel Shanmugasundaram
VLDB J.6
2008 WYSIWYG development of data driven web applications
abstract
An emerging trend in Social Networking sites and Web portals is the opening up of their APIs to external application developers. For example, the Facebook Platform, Google Gadgets and Yahoo! Widgets allow developers to design their own applications, which can then can be integrated with the platform and shared with other users. However, current APIs are targeted towards developers with programming expertise and database knowledge; they are not accessible to a large class of users who do not have a programming/database background, but would nevertheless like to create new applications. To address this need, we have developed the AppForge system, which provides a WYSIWYG application development platform. Users can graphically specify the components of webpages inside a Web browser, and the corresponding database schema and application logic will be automatically generated on the fly by the system. The WYSIWYG interface gives instantaneous feedback on what users have created and allows them to run, test and continuously refine their applications. AppForge has been used to create prototype versions of a variety of applications such as an event planning system, a recruiting system, an item trading system and an online course management system. We have also conducted a small and preliminary user study to identify and fix some of the usability aspects of AppForge.
Fan Yang 0002, Nitin Gupta 0003, Chavdar Botev, Elizabeth F. Churchill, George Levchenko, Jayavel Shanmugasundaram
Proc. VLDB Endow.1
2007 User-centric personalized extensibility for data-driven web applications
abstract
We describe a novel programming model for building, extending, and personalizing web-based data-driven applications.
Nitin Gupta 0003, Fan Yang 0002, Alan J. Demers, Johannes Gehrke, Jayavel Shanmugasundaram
SIGMOD Conference2
2007 Efficient Keyword Search over Virtual XML Views
Feng Shao 0002, Chavdar Botev, Anand Bhaskar, Muthiah Chettiar, Fan Yang 0002, Jayavel Shanmugasundaram
VLDB6
2007 A unified platform for data driven web applications with automatic client-server partitioning
abstract
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition application functionality across the tiers, resulting in complex logic, suboptimal partitioning, and expensive re-partitioning of applications. In this paper, we introduce a unified platform for automatic partitioning of data-driven web applications. Our approach is based on Hilda[41, 46], a high-level declarative programming language with a unified data and programming model for all the layers of the application. Based on run-time properties of the application, Hilda's run time system automatically partitions the application between the tiers to improve response time while adhering to memory and/ or processing constraints at the clients. We evaluate our methodology with traces from a real application and with TPC-W, and our results show that automatic partitioning outperforms manual partitioning without the associated development overhead.
Fan Yang 0002, Nitin Gupta 0003, Nicholas Gerner, Xin Qi 0012, Alan J. Demers, Johannes Gehrke, Jayavel Shanmugasundaram
WWW1
2006 Hilda: A High-Level Language for Data-DrivenWeb Applications
abstract
We propose Hilda, a high-level language for developing data-driven web applications. The primary benefits of Hilda over existing development platforms are: (a) it uses a unified data model for all layers of the application, (b) it is declarative, (c) it models both application queries and updates, (d) it supports structured programming for web sites, and (e) it enables conflict detection for concurrent updates. We also describe the implementation of a simple proof-ofconcept Hilda compiler, which translates a Hilda application program into Java Servlet code.
Fan Yang 0002, Jayavel Shanmugasundaram, Mirek Riedewald, Johannes Gehrke
ICDE1
2006 Quark: an efficient XQuery full-text implementation
abstract
The XQuery 1.0 and XPath 2.0 Full-text (XQFT) language has been developed by the W3C to extend XQuery and XPath with full-text search capabilities. XQFT allows users to specify a mix of structured and complex full-text predicates, and also allows users to score/rank such queries. The power and flexibility of XQFT gives rise to two interesting questions. First, is it possible to efficiently integrate a full-function XML query language with sophisticated full-text search? Second, is it possible to score and rank arbitrary XQuery and XQFT queries? In this demonstration, we present evidence that it is indeed possible to achieve the above goals. We demonstrate the Quark open-source data management system and show how we can seamlessly and efficiently integrate structured and unstructured search over XML data. In particular, we demonstrate (a) techniques for efficiently evaluating keyword search over virtual XML views, and (b) a framework for scoring both structured and full-text predicates.
Anand Bhaskar, Chavdar Botev, Muthiah Chettiar, Jayavel Shanmugasundaram, Feng Shao 0002, Fan Yang 0002
SIGMOD Conference7
2006 Automatic client-server partitioning of data-driven web applications
abstract
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript and HTML). Consequently, the application developer is forced to partition the application code between the server and client at the time of writing the application. However, the partitioning of the code between the client and server may have to be changed during the evolution of the application for performance reasons (it may be better to push more functionality to the client), for correctness reasons (data that conflicts with multiple clients cannot always be pushed to clients), and for supporting clients with different computing power (browsers on desktops vs. PDAs). Since the client and server use different programming models, moving application code from client to server (and vice versa) reduces programmer productivity and also has the potential to introduce concurrency bugs. In this demonstration, we advocate an alternative solution to this problem: we propose developing applications using a unified declarative high-level language called Hilda, and show how a Hilda compiler can automatically (and correctly) partition Hilda code between the client and the server using a real Course Management System application. We illustrate our techniques using two clients: a powerful laptop machine and a less powerful PDA.
Nicholas Gerner, Fan Yang 0002, Alan J. Demers, Johannes Gehrke, Mirek Riedewald, Jayavel Shanmugasundaram
SIGMOD Conference2