Sciweavers

149 search results - page 12 / 30
» Practical Techniques for Searches on Encrypted Data
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 9 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
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...
DLOG
2009
13 years 6 months ago
OWL Reasoning in the Real World: Searching for Godot
I will provide an overview of many of the use cases that we looked at to apply OWL ABox reasoning in the real world. The fields we covered included (a) healthcare, and life science...
Kavitha Srinivas
CSE
2009
IEEE
14 years 1 months ago
Social Tagging in Query Expansion: A New Way for Personalized Web Search
Social networks and collaborative tagging systems are rapidly gaining popularity as primary means for sorting and sharing data: users tag their bookmarks in order to simplify infor...
Claudio Biancalana, Alessandro Micarelli
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 9 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...