Sciweavers

151 search results - page 3 / 31
» Answering approximate queries over autonomous web databases
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 10 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
ADC
2006
Springer
142views Database» more  ADC 2006»
14 years 1 months ago
An optimization for query answering on ALC database
Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has be...
Pakornpong Pothipruk, Guido Governatori
AAAI
2006
13 years 9 months ago
Supporting Queries with Imprecise Constraints
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
Ullas Nambiar, Subbarao Kambhampati