![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
9. WebDB 2006: Chicago, Illinois, USA
- Ninth International Workshop on the Web and Databases, WebDB 2006, Chicago, Illinois, USA, June 30, 2006. 2006
Web Search
- Michael N. Gubanov, Philip A. Bernstein:
Structural text search and comparison using automatically extracted schema. - Julia Luxenburger, Gerhard Weikum:
Exploiting Community Behavior for Enhanced Link Analysis and Web Search. - Wei Liu, Xiaofeng Meng, Weiyi Meng:
Vision-based Web Data Records Extraction. - Jing Liu, Xin Dong, Alon Y. Halevy:
Answering Structured Queries on Unstructured Data.
Semistructured Data
- Benny Kimelfeld, Yehoshua Sagiv:
Twig Patterns: From XML Trees to Graphs. - Claudio Gutierrez, Carlos A. Hurtado, Alejandro A. Vaisman:
The Meaning of Erasing in RDF under the Katsuno-Mendelzon Approach. - Taro L. Saito, Shinichi Morishita:
Amoeba Join: Overcoming Structural Fluctuations in XML Data.
Peer-to-Peer Systems
- Jie Xu, Alexandros Labrinidis:
Replication-Aware Query Processing in Large-Scale Distributed Information Systems. - Dongmei Jia, Wai Gen Yee, Ophir Frieder:
Automatic Tuning of File Descriptors in P2P File-Sharing Systems. - Yuh-Jzer Joung, Li-Wei Yang:
KISS: A Simple Prefix Search Scheme in P2P Networks. - Matthias Bender, Sebastian Michel, Peter Triantafillou, Gerhard Weikum:
Global Document Frequency Estimation in Peer-to-Peer Web Search.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.