Sciweavers

360 search results - page 27 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 6 days ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya

Publication
502views
15 years 8 months ago
Spatio-Temporal Histograms
This paper presents a framework for building and continuously maintaining spatio-temporal histograms (ST-Histograms, for short). ST-Histograms are used for selectivity estimation o...
Hicham G. Elmongui, Mohamed F. Mokbel, Walid G. Ar...
APWEB
2010
Springer
14 years 1 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
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 1 days ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
ML
2008
ACM
248views Machine Learning» more  ML 2008»
13 years 8 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...