Sciweavers

390 search results - page 3 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
15 years 7 days ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
15 years 7 days ago
Pointwise-Dense Region Queries in Spatio-temporal Databases
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
Jinfeng Ni, Chinya V. Ravishankar
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
14 years 11 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 1 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
WEBDB
2004
Springer
202views Database» more  WEBDB 2004»
14 years 4 months ago
Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we ...
Ullas Nambiar, Subbarao Kambhampati