A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Answering approximate queries over autonomous web databases
2009
Proceedings of the 18th international conference on World wide web - WWW '09
Preserved Fulltext
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and ranked query results. ...
For the approximate query results, we generate users' contextual preferences from database workload and use them to create a priori orders of tuples in an off-line preprocessing step. ...
Then we presented AQRR, a domain independent approach for answering approximate queries over autonomous Web databases. ...
doi:10.1145/1526709.1526846
dblp:conf/www/MengMY09
fatcat:i3zpn2kqkbcmxjgobisjxxw2qa
QPIAD: Query Processing over Incomplete Autonomous Databases
2007
2007 IEEE 23rd International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through mediators. ...
Our technique involves reformulating the user query based on approximate functional dependencies (AFDs) among the database attributes and ranking these queries using value distributions learned from Naïve ...
Queries on the global schema are then rewritten as queries over autonomous databases through their web interfaces. ...
doi:10.1109/icde.2007.369028
dblp:conf/icde/KhatriFCK07
fatcat:gvjaqkfhrbe6ppaou7ugh4mnrm
Answering Imprecise Queries over Autonomous Web Databases
2006
22nd International Conference on Data Engineering (ICDE'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We present AIMQ, a domain and user independent approach for answering imprecise queries over autonomous Web databases. ...
We developed methods for query relaxation that use approximate functional dependencies. We also present an approach to automatically estimate the similarity between values of categorical attributes. ...
over an autonomous Web database. ...
doi:10.1109/icde.2006.20
dblp:conf/icde/NambiarK06
fatcat:2anlsxfrx5f3ja4qvv37365uyq
Mining approximate functional dependencies and concept similarities to answer imprecise queries
2004
Proceedings of the 7th International Workshop on the Web and Databases colocated with ACM SIGMOD/PODS 2004 - WebDB '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper we focus on providing a domain and end-user independent solution for supporting imprecise queries over Web databases without affecting the underlying database. ...
We propose a query processing framework that integrates techniques from IR and database research to efficiently determine answers for imprecise queries. ...
queries over autonomous databases. ...
doi:10.1145/1017074.1017093
dblp:conf/webdb/NambiarK04
fatcat:7uwhbll2kvhxflumzwyokio3aa
Query processing over incomplete autonomous databases: query rewriting using learned data dependencies
2009
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The autonomous nature of web databases poses several challenges in realizing this objective. ...
Our Approach: In this paper, we present QPIAD, 3 a system for mediating over incomplete autonomous databases. ...
Queries on the global schema are then rewritten as queries over autonomous databases through their web interfaces. ...
doi:10.1007/s00778-009-0155-0
fatcat:hkoyyibu55bmfnq6gmqbthphee
Providing ranked relevant results for web database queries
2004
Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Often Web database users experience difficulty in articulating their needs using a precise query. Providing ranked set of possible answers would benefit such users. ...
We propose to provide ranked answers to user queries by identifying a set of queries from the query log whose answers are relevant to the given user query. ...
Moreover to extract answers from Web databases one must issue a query over the database. ...
doi:10.1145/1010432.1010517
fatcat:cdxx3ttsybfnphowjsnzig6pee
Providing ranked relevant results for web database queries
2004
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Often Web database users experience difficulty in articulating their needs using a precise query. Providing ranked set of possible answers would benefit such users. ...
We propose to provide ranked answers to user queries by identifying a set of queries from the query log whose answers are relevant to the given user query. ...
Moreover to extract answers from Web databases one must issue a query over the database. ...
doi:10.1145/1013367.1013452
dblp:conf/www/NambiarK04
fatcat:c6lgzmsa4zhkbjjjj273b6itp4
SMARTINT: A system for answering queries over web databases using attribute dependencies
2010
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. ...
Many web databases can be seen as providing partial and overlapping information about entities in the world. ...
Learning: Since learning in SMARTINT is done offline before query processing, we will show the different Approximate Functional Dependencies(AFDs) mined from Web databases. ...
doi:10.1109/icde.2010.5447729
dblp:conf/icde/GummadiKKSK10
fatcat:zbrqshwdbfhkpabw7dk2c36t7e
Bayes Networks for Supporting Query Processing Over Incomplete Autonomous Databases
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
on the query-constrained attributes, when the data sources are autonomous). ...
Our approach involves mining/"learning" Bayes networks from a sample of the database, and using it to do both imputation (predict a missing value) and query rewriting (retrieve relevant results with incompleteness ...
Incompleteness in Autonomous Databases: Increasingly many of the autonomous web databases are being populated by automated techniques or by lay users, with very little curation. ...
arXiv:1208.5745v1
fatcat:o6ih7zdjnre7pnoxbm2uei7dv4
Bayesian networks for supporting query processing over incomplete autonomous databases
2013
Journal of Intelligent Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
incompleteness on the query-constrained attributes, when the data sources are autonomous). ...
Our approach involves mining/"learning" Bayesian networks from a sample of the database, and using it to do both imputation (predict a missing value) and query rewriting (retrieve relevant results with ...
Incompleteness in autonomous databases Increasingly many of the autonomous web databases are being populated by automated techniques or by naïve users, with very little curation. ...
doi:10.1007/s10844-013-0277-0
fatcat:ghxs4a4t6zgzfpcgt2kglizbou
Ranking Issues for Information Integration
2007
2007 IEEE 23rd International Conference on Data Engineering Workshop
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Currently, the notion of ranking is being applied to database query answers (ordering based on user criteria) in order to retrieve top-k answers. ...
When the answers of a query or search are varying in quality and are large in numbers, it is necessary to rank/order these answers based on some criteria. ...
As databases become available on the web in the form of hidden-web [8] , it becomes necessary for the query interfaces exported by these database to support IR-like queries. ...
doi:10.1109/icdew.2007.4401001
dblp:conf/icde/TelangMC07
fatcat:dlzh3x2evbgx3gq2h6uwhain34
SMARTINT: using mined attribute dependencies to integrate fragmented web databases
2011
Journal of Intelligent Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. ...
We present a unified approach that supports intelligent retrieval over fragmented web databases by mining and using intertable dependencies. ...
CONCLUSION We presented a unified approach that supports intelligent retrieval over fragmented web databases by mining and using inter-table dependencies. ...
doi:10.1007/s10844-011-0169-0
fatcat:voy66c2sijacjb7gaceqx4o7p4
SmartInt
2011
Proceedings of the 20th international conference companion on World wide web - WWW '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. ...
We present a unified approach that supports intelligent retrieval over fragmented web databases by mining and using intertable dependencies. ...
CONCLUSION We presented a unified approach that supports intelligent retrieval over fragmented web databases by mining and using inter-table dependencies. ...
doi:10.1145/1963192.1963219
dblp:conf/www/GummadiKKSK11
fatcat:753znjzpurffnpkdf4y5j6dpwa
SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Given a query, our system uses the Approximate Functional Dependencies (AFDs) to piece together a tree of relevant tables to answer it. ...
To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. ...
Section 2 discusses related work about current approaches for query answering over web databases. Section 3 discusses some preliminaries. ...
arXiv:1101.5334v2
fatcat:o5qhmk46wbf3zc36zp6cvffkju
Querying and Searching Heterogeneous Knowledge Graphs in Real-time Linked Dataspaces
[chapter]
2019
Real-time Linked Dataspaces
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Approaches used for querying siloed databases fail within large dataspaces because users do not have an a priori understanding of all the available datasets. ...
Section 7.3 introduces search and query over dataspaces, discusses the challenges with data heterogeneity in a dataspace, and identifies the core requirement for the search and query service. ...
As opposed to IR techniques' best-effort nature, QA systems target crisp answers, as with structured queries over databases. ...
doi:10.1007/978-3-030-29665-0_7
fatcat:7qb2boh7njgvjiknknaaig5cou
« Previous
Showing results 1 — 15 out of 8,501 results