Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFletcher, George H. L.-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorVan Gucht, Dirk-
dc.contributor.authorVANSUMMEREN, Stijn-
dc.identifier.citationACM TRANSACTIONS ON DATABASE SYSTEMS, 35(4). p. 1-33-
dc.description.abstractThe 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.-
dc.subject.otherDesign; Languages; Theory; Dataspaces; genericity; search-
dc.titleTowards a Theory of Search Queries-
dc.typeJournal Contribution-
local.bibliographicCitation.conferencename28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS)-
local.bibliographicCitation.conferenceplaceProvindence, USA, JUN 29-JUL 01, 2009-
dc.description.notes[Fletcher, George H. L.] Eindhoven Univ Technol, Fac Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands. [Van den Bussche, Jan] Hasselt Univ, Database & Theoret Comp Sci Grp, B-3590 Diepenbeek, Belgium. [Van den Bussche, Jan] Transnatl Univ Limburg, B-3590 Diepenbeek, Belgium. [Van Gucht, Dirk] Indiana Univ, Dept Comp Sci, Bloomington, IN 47405 USA. [Vansummeren, Stijn] Univ Libre Bruxelles, Lab Web & Informat Technol, B-1050 Brussels, Belgium. [Vansummeren, Stijn] Hasselt Univ, Res Fdn Flanders, B-3590 Diepenbeek, Belgium.-
item.accessRightsClosed Access-
item.fullcitationFletcher, George H. L.; VAN DEN BUSSCHE, Jan; Van Gucht, Dirk & VANSUMMEREN, Stijn (2010) Towards a Theory of Search Queries. In: ACM TRANSACTIONS ON DATABASE SYSTEMS, 35(4). p. 1-33.-
item.fulltextNo Fulltext-
item.validationecoom 2012-
Appears in Collections:Research publications
Show simple item record

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.