Sciweavers

2859 search results - page 430 / 572
» Querying Complex Structured Databases
Sort
View
159
Voted
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 6 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
118
Voted
SIGIR
2008
ACM
15 years 2 months ago
Crosslingual location search
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
Tanuja Joshi, Joseph Joy, Tobias Kellner, Udayan K...
136
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 2 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
OOPSLA
2007
Springer
15 years 8 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
138
Voted
CCS
2011
ACM
14 years 2 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg