skip to main content
10.1145/1859127acmconferencesBook PagePublication PageswebdbConference Proceedingsconference-collections
WebDB '10: Procceedings of the 13th International Workshop on the Web and Databases
ACM2010 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SIGMOD/PODS '10: International Conference on Management of Data Indianapolis Indiana 6 June 2010
ISBN:
978-1-4503-0186-2
Published:
06 June 2010
Sponsors:

Bibliometrics
Abstract

No abstract available.

Skip Table Of Content Section
SESSION: Keynote speech
keynote
The web of linked data: a global public dataspace on the web: WebDB 2010 keynote

In 2005, Michael Franklin, Alon Halevy, and David Maier coined the term dataspaces as a new abstraction and target architecture for data management. In 2006, Tim Berners-Lee introduced the Linked Data principles a set of best practices for publishing ...

SESSION: Linked data and Wikipedia
research-article
An agglomerative query model for discovery in linked data: semantics and approach

Data on the Web is increasingly being used for discovery and exploratory tasks. Unlike traditional fact-finding tasks that require only the typical single-query and response paradigm, these tasks involve a multistage search process in which bits of ...

research-article
XML-based RDF data management for efficient query processing

The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable data repositories that can store RDF data and support efficient evaluation ...

research-article
Querying Wikipedia documents and relationships

Wikipedia has become an important source of information which is growing very rapidly. However, the existing infrastructure for querying this information is limited and often ignores the inherent structure in the information and links across documents. ...

research-article
WikiAnalytics: disambiguation of keyword search results on highly heterogeneous structured data

Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogenous dataset, where any given record has only a tiny fraction of all possible fields. Such data cannot be queried using traditional means without a massive a priori ...

SESSION: Extraction
research-article
Find your advisor: robust knowledge gathering from the web

We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of interest. Our approach combines these generalized patterns for high recall ...

research-article
Redundancy-driven web data extraction and integration

A large number of web sites publish pages containing structured information about recognizable concepts, but these data are only partially used by current applications. Although such information is spread across a myriad of sources, the web scale ...

research-article
Using latent-structure to detect objects on the web

An important requirement for emerging applications which aim to locate and integrate content distributed over the Web is to identify pages that are relevant for a given domain or task. In this paper, we address the problem of identifying pages that ...

research-article
Popularity-guided top-k extraction of entity attributes

Recent progress in information extraction technology has enabled a vast array of applications that rely on structured data that is embedded in natural-language text. In particular, the extraction of concepts from the Web---with their desired attributes--...

SESSION: Management and mining of large-scaled data
research-article
Manimal: relational optimization for data-intensive programs

The MapReduce distributed programming framework is very popular, but currently lacks the optimization techniques that have been standard with relational database systems for many years. This paper proposes Manimal, which uses static code analysis to ...

research-article
Learning topical transition probabilities in click through data with regression models

The transition of search engine users' intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how different topics are related and be used in many applications, such as building ...

research-article
Improved recommendations via (more) collaboration

We consider in this paper a popular class of recommender systems that are based on Collaborative Filtering (CF for short). CF is the process of predicting customer ratings to items based on previous ratings of (similar) users to (similar) items, and is ...

SESSION: Protocols and models for web data
research-article
Concurrent one-way protocols in around-the-clock social networks

We introduce and study concurrent One-Way Protocols in social networks. The model is motivated by the rise of online social networks and the fast development of automation features in them. In a One-Way architecture, used, e.g., by Twitter, participants ...

research-article
Reconciling two models of multihierarchical markup

For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping or multihierarchical markup that has both a graph-based and a text-and-...

research-article
Tree patterns with full text search

Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an answer. But this requirement may lead to undesirable behavior of XML ...

Contributors
  • Hasso Plattner Institute for Digital Engineering gGmbH
Index terms have been assigned to the content through auto-classification.

Recommendations

Acceptance Rates

Overall Acceptance Rate30of100submissions,30%
YearSubmittedAcceptedRate
WebDB'1819526%
WebDB'1721733%
WebDB '1629931%
WebDB'1531929%
Overall1003030%