%0 Conference Paper %1 1247487 %A Dong, Xin %A Halevy, Alon %B SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data %C New York, NY, USA %D 2007 %I ACM %K data-integration dataspaces indexing %P 43--54 %R http://doi.acm.org/10.1145/1247480.1247487 %T Indexing dataspaces %U http://portal.acm.org/citation.cfm?doid=1247480.1247487 %X Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-integration systems that also offer uniform access to heterogeneous data sources, dataspaces do not assume that all the semantic relationships between sources are known and specified. Much of the user interaction with dataspaces involves exploring the data, and users do not have a single schema to which they can pose queries. Consequently, it is important that queries are allowed to specify varying degrees of structure, spanning keyword queries to more structure-aware queries. This paper considers indexing support for queries that combine keywords and structure. We describe several extensions to inverted lists to capture structure when it is present. In particular, our extensions incorporate attribute labels, relationships between data items, hierarchies of schema elements, and synonyms among schema elements. We describe experiments showing that our indexing techniques improve query efficiency by an order of magnitude compared with alternative approaches, and scale well with the size of the data. %@ 978-1-59593-686-8

@inproceedings{1247487, abstract = {Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-integration systems that also offer uniform access to heterogeneous data sources, dataspaces do not assume that all the semantic relationships between sources are known and specified. Much of the user interaction with dataspaces involves exploring the data, and users do not have a single schema to which they can pose queries. Consequently, it is important that queries are allowed to specify varying degrees of structure, spanning keyword queries to more structure-aware queries. This paper considers indexing support for queries that combine keywords and structure. We describe several extensions to inverted lists to capture structure when it is present. In particular, our extensions incorporate attribute labels, relationships between data items, hierarchies of schema elements, and synonyms among schema elements. We describe experiments showing that our indexing techniques improve query efficiency by an order of magnitude compared with alternative approaches, and scale well with the size of the data.}, added-at = {2009-09-23T22:44:17.000+0200}, address = {New York, NY, USA}, author = {Dong, Xin and Halevy, Alon}, biburl = {https://www.bibsonomy.org/bibtex/2390df925cc4afb2b7f0c963b901e35b6/hidders}, booktitle = {SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data}, description = {Indexing dataspaces}, doi = {http://doi.acm.org/10.1145/1247480.1247487}, interhash = {51debf6b965efd8721e042acc987e79d}, intrahash = {390df925cc4afb2b7f0c963b901e35b6}, isbn = {978-1-59593-686-8}, keywords = {data-integration dataspaces indexing}, location = {Beijing, China}, pages = {43--54}, publisher = {ACM}, timestamp = {2009-09-23T22:44:17.000+0200}, title = {Indexing dataspaces}, url = {http://portal.acm.org/citation.cfm?doid=1247480.1247487}, year = 2007 }