Sciweavers

1890 search results - page 54 / 378
» Querying Big Data by Accessing Small Data
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
15 years 11 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
BMCBI
2007
108views more  BMCBI 2007»
14 years 11 months ago
Publishing perishing? Towards tomorrow's information architecture
Scientific articles are tailored to present information in human-readable aliquots. Although the Internet has revolutionized the way our society thinks about information, the trad...
Michael R. Seringhaus, Mark B. Gerstein
NDSS
2008
IEEE
15 years 5 months ago
Usable PIR
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
Peter Williams, Radu Sion
APWEB
2010
Springer
15 years 3 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
AAAI
2006
15 years 13 days ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter