First order normal form for relational databases and multidatabases
ACM SIGMOD Record
On genericity and parametricity (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modal logic
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Storage and Querying of E-Commerce Data
Proceedings of the 27th International Conference on Very Large Data Bases
Towards a Language for the Fully Generic Queries
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Efficient set joins on similarity predicates
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Foundations of semantic web databases
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Semijoin Algebra and the Guarded Fragment
Journal of Logic, Language and Information
Principles of dataspace systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
iDM: a unified and versatile data model for personal dataspace management
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the complexity of division and set joins in the relational algebra
Journal of Computer and System Sciences
Making database systems usable
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Pig latin: a not-so-foreign language for data processing
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Introduction to Information Retrieval
Introduction to Information Retrieval
nSPARQL: A Navigational Language for RDF
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Towards a theory of search queries
Proceedings of the 12th International Conference on Database Theory
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Keyword search in databases: the power of RDBMS
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
SWDB'04 Proceedings of the Second international conference on Semantic Web and Databases
Proceedings of the 13th International Conference on Computer Systems and Technologies
Efficient processing of containment queries on nested sets
Proceedings of the 16th International Conference on Extending Database Technology
What we talk about when we talk about graphs
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Hi-index | 0.01 |
The need to manage diverse information sources has triggered the rise of very loosely structured data models, known as dataspace models. Such information management systems must allow querying in simple ways, mostly by a form of searching. Motivated by these developments, we propose a theory of search queries in a general model of dataspaces. In this model, a dataspace is a collection of data objects, where each data object is a collection of data items. Basic search queries are expressed using filters on data items, following the basic model of Boolean search in information retrieval. We characterize semantically the class of queries that can be expressed by searching. We apply our theory to classical relational databases, where we connect search queries to the known class of fully generic queries, and to dataspaces where data items are formed by attribute-value pairs. We also extend our theory to a more powerful, associative form of searching, where one can ask for objects that are similar to objects satisfying given search conditions. Such associative search queries are shown to correspond to a very limited kind of joins. We show that the basic search language extended with associative search can exactly define the queries definable in a restricted fragment of the semijoin algebra working on an explicit relational representation of the dataspace.