Sciweavers

568 search results - page 61 / 114
» Query by table
Sort
View
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
15 years 10 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
APWEB
2010
Springer
15 years 2 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
WWW
2008
ACM
15 years 10 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
15 years 10 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
SSD
2007
Springer
155views Database» more  SSD 2007»
15 years 4 months ago
MobiHide: A Mobilea Peer-to-Peer System for Anonymous Location-Based Queries
Abstract. Modern mobile phones and PDAs are equipped with positioning capabilities (e.g., GPS). Users can access public location-based services (e.g., Google Maps) and ask spatial ...
Gabriel Ghinita, Panos Kalnis, Spiros Skiadopoulos