Sciweavers

365 search results - page 32 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
AMW
2009
15 years 27 days ago
Identifying Algebraic Properties to Support Optimization of Unary Similarity Queries
Conventional operators for data retrieval are either based on exact matching or on total order relationship among elements. Neither of them is appropriate to manage complex data, s...
Mônica Ribeiro Porto Ferreira, Agma J. M. Tr...
PODS
2010
ACM
306views Database» more  PODS 2010»
15 years 4 months ago
Optimizing linear counting queries under differential privacy
Differential privacy is a robust privacy standard that has been successfully applied to a range of data analysis tasks. But despite much recent work, optimal strategies for answe...
Chao Li, Michael Hay, Vibhor Rastogi, Gerome Mikla...
CIDR
2011
401views Algorithms» more  CIDR 2011»
14 years 3 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
CIDR
2003
134views Algorithms» more  CIDR 2003»
15 years 1 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
15 years 12 months ago
Stretch 'n' shrink: resizing queries to user preferences
We present Stretch `n' Shrink, a query design framework that explicitly takes into account user preferences about the desired answer size, and subsequently modifies the query...
Chaitanya Mishra, Nick Koudas