Sciweavers

2070 search results - page 254 / 414
» Querying Communities in Relational Databases
Sort
View
APWEB
2010
Springer
15 years 11 months ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
HICSS
1996
IEEE
74views Biometrics» more  HICSS 1996»
15 years 10 months ago
Querying Structured Hyperdocuments
In this paper, we present a document model which integrates the logical structure and hypertext link structure of hyperdocuments in order to manage structured documents with hyper...
Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Br...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 10 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
TKDE
2012
194views Formal Methods» more  TKDE 2012»
13 years 8 months ago
A Query Formulation Language for the Data Web
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
Mustafa Jarrar, Marios D. Dikaiakos
EDBT
2012
ACM
247views Database» more  EDBT 2012»
13 years 8 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...