| |||||||||||||||||
VLDS 2011 : First International Workshop on Searching and Integrating New Web Data Sources | |||||||||||||||||
Link: http://vlds2011.search-computing.net | |||||||||||||||||
| |||||||||||||||||
Call For Papers | |||||||||||||||||
----------------------------------------------------------------------
*VLDS 2011: VERY LARGE DATA SEARCH* *First International Workshop on Searching* *and Integrating New Web Data Sources* ---------------------------------------------------------------------- Seattle, September 2nd, 2011 Co-located with VLDB 2011 (Very Large DataBases) http://vlds2011.search-computing.org First Call for Papers *Goal of the workshop* ---------------------------------------------------------------------- Searching for data upon new, open, linked Web data sources has the potential of reshaping the scenario of current Web applications, going beyond the capabilities of conventional search engines in solving search problems, but also presents new technical challenges. Solving data integration problems requires new solutions, including the use of universal URIs, efficient indexing, partial or approximate value matching, rank aggregation, continuous or push-based search, exploratory methods and context-aware paradigms, collaborative and social search and information retrieval. The goal of this workshop is to gather researchers and practitioners in the diverse fields related to data integration and search applications on the web at the purpose of discussing innovative strategies for combining search facilities with integration aspects for Web data sources. The workshop represents a unique venue for discussing all the aspects related to the implementation, publication, and orchestration of services over new Web data sources, the most suitable paradigms to improve the user experience in context, as well as the search application scenarios which may better benefit of these new technologies, including enterprise applications, recommender systems, and social search. *Keynote speakers* ---------------------------------------------------------------------- * Hector Garcia-Molina, Stanford University * Alon Halevy, Google *Topics of interest* ---------------------------------------------------------------------- The topics of interest for this workshop include (but are not limited to): * Methods and tools for Search Services: o Modeling and Exposing search functionalities as services o Deploying and Using search services o Languages and platforms for composing search services o Best practices and methodologies for designing and composing search services o Mashup platforms and practices applied to search * Methods and tools for deep web information access: o Exploitation of public APIs for search (e.g., Google APIs, Yahoo Query Language – YQL) o Implementation issues of ranking, ordering, and chunking in queries on data sources o Use of query languages (including SQL, SPARQL, XQuery) for deep web data sources o Mashup platforms and practices for deep web data * Methods and Tools for domain-specific search: o Algorithms and tools for domain-specific or purpose-specific search o Best practices and methodologies for domain or purpose-specific search * Methods and Tools for Open Linked Data: o Algorithms and tools for search and exploration over linked and semantically-enriched data o Methods for preparing and labeling data to support search applications * User experience of search o User interfaces for search, including purpose or domain-specific services o Information exploration and exploratory search o Continuous, incremental and push-based search * Applications of search o Warehousing and integration of searchable data o Enterprise search applications o Social search o Web recommender systems * Benchmarks for search applications on integrated data *Submission guidelines* ---------------------------------------------------------------------- The workshop will accept: * Regular research papers (maximum lenght: 6 pages) * Industrial / Experience papers (maximum lenght: 4 pages) * Position / Vision papers (maximum lenght: 4 pages) All the submissions must be formatted according to the ACM double column format. Submissions will be accepted only through the EasyChair submission site: https://www.easychair.org/conferences/?conf=vlds2011 *Important dates* ---------------------------------------------------------------------- * Abstract submission deadline: June 1, 2011 * Papers submission deadline: June 7, 2011 * Notification of papers acceptance: July 1, 2011 * Papers camera-ready version: July 7, 2011 * Workshop date: September 2nd, 2011 *Workshop Proceedings* ---------------------------------------------------------------------- The proceedings of the workshop will be published in a PVLDB volume. Higher quality papers will be selected for extended publication in a post-proceedings book published by Springer together with a collection of best papers from other workshops on search-related topics. The volume publication has been already approved by Springer. *Organizers* ---------------------------------------------------------------------- *Marco Brambilla* Politecnico di Milano, Italy *Fabio Casati* Università di Trento, Italy *Stefano Ceri* Politecnico di Milano, Italy *Program Committee* ---------------------------------------------------------------------- * Ricardo Baeza-Yates, Yahoo! Research * Boualem Benatallah, UNSW Sydney * Paolo Boldi, Università Statale di Milano * Jérémie Bordier, Exalead * Tevfik Bultan, UC Santa Barbara * Paolo Castagna, Talis * Tiziana Catarci, Univ. La Sapienza di Roma * Florian Daniel, Università di Trento * Arjen P. De Vries, CWI Amsterdam * Marlon Dumas, University of Tartu * Schahram Dustdar, Vienna Univ. of Technology * Dimitrios Georgakopoulos, CSIRO * Georg Gottlob, Oxford University * Alon Halevy, Google * Ian Horrocks, Oxford University * Vagelis Hristidis, Florida Int. University * Rick Hull, IBM Research * Christian Konig, Microsoft * Ee-Peng Lim, SMU Singapore * Ioana Manolescu, INRIA * Hamid Motahari, Hewlett-Packard * Norman Paton, Manchester University * Gabriella Pasi, Università Mi-Bicocca * Fabian Suchanek, INRIA * Gerhard Weikum, MPI Saarbruken |
|