Sciweavers

390 search results - page 27 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
GLOBE
2009
Springer
15 years 2 months ago
Designing, Specifying and Querying Metadata for Virtual Data Integration Systems
Abstract. We show how to specify and use the metadata for a virtual and relational data integration system under the local-as-view (LAV) approach. We use XML and RuleML for represe...
Leopoldo E. Bertossi, Gayathri Jayaraman
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
15 years 11 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
15 years 2 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
15 years 10 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
DC
2008
14 years 9 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir