Sciweavers

2859 search results - page 199 / 572
» Querying Complex Structured Databases
Sort
View
CHI
2011
ACM
14 years 6 months ago
A spreadsheet-based user interface for managing plural relationships in structured data
A key feature of relational database applications is managing plural relationships—one-to-many and many-to-many— between entities. However, since it is often infeasible to ado...
Eirik Bakke, David R. Karger, Rob Miller
127
Voted
FOCS
2006
IEEE
15 years 8 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
137
Voted
EDBTW
2010
Springer
15 years 9 months ago
SPARQL query rewriting for implementing data integration over linked data
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
Gianluca Correndo, Manuel Salvadores, Ian Millard,...
134
Voted
GPC
2010
Springer
15 years 9 months ago
Distributed Island-Based Query Answering for Expressive Ontologies
Scalability of reasoning systems is one of the main criteria which will determine the success of Semantic Web systems in the future. The focus of recent work is either on (a) expre...
Sebastian Wandelt, Ralf Möller
EWDW
1994
15 years 6 months ago
Optimization of Object-Oriented Queries by Inverse Methods
For object-oriented databases we propose a new technique for optimizing queries containing method invocations. This technique is based on the definition of inverse methods and que...
Johann Eder, Heinz Frank, Walter Liebhart