Sciweavers

470 search results - page 6 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 10 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...
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 11 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 3 days ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
VLDB
1999
ACM
97views Database» more  VLDB 1999»
14 years 1 months ago
Relational Databases for Querying XML Documents: Limitations and Opportunities
XML is fast emerging as the dominant standard for representing data in the World Wide Web. Sophisticated query engines that allow users to effectively tap the data stored in XML d...
Jayavel Shanmugasundaram, Kristin Tufte, Chun Zhan...
JACM
2000
81views more  JACM 2000»
13 years 8 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin