SemFacet: Making hard faceted search easier
Faceted search is a prominent search paradigm that became the standard in many Web applications and has also been recently proposed as a suitable paradigm for exploring and querying RDF graphs. One of the main challenges that hampers usability of faceted search systems especially in the RDF context...
| Main Authors: | , , , , , |
|---|---|
| Format: | Conference item |
| Published: |
Association for Computing Machinery
2017
|
| _version_ | 1826277747670908928 |
|---|---|
| author | Kharlamov, E Giacomelli, L Sherkhonov, E Grau, B Kostylev, EV Horrocks, I |
| author_facet | Kharlamov, E Giacomelli, L Sherkhonov, E Grau, B Kostylev, EV Horrocks, I |
| author_sort | Kharlamov, E |
| collection | OXFORD |
| description | Faceted search is a prominent search paradigm that became the standard in many Web applications and has also been recently proposed as a suitable paradigm for exploring and querying RDF graphs. One of the main challenges that hampers usability of faceted search systems especially in the RDF context is information overload, that is, when the size of faceted interfaces becomes comparable to the size of the data over which the search is performed. In this demo we present (an extension of) our faceted search system SemFacet and focus on features that address the information overload: ranking, aggregation, and reachability. The demo attendees will be able to try our system on an RDF graph that models online shopping over a catalogs with up to millions of products. |
| first_indexed | 2024-03-06T23:33:34Z |
| format | Conference item |
| id | oxford-uuid:6cdf5a46-5792-471d-a1f5-43019591a877 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T23:33:34Z |
| publishDate | 2017 |
| publisher | Association for Computing Machinery |
| record_format | dspace |
| spelling | oxford-uuid:6cdf5a46-5792-471d-a1f5-43019591a8772022-03-26T19:14:03ZSemFacet: Making hard faceted search easierConference itemhttp://purl.org/coar/resource_type/c_5794uuid:6cdf5a46-5792-471d-a1f5-43019591a877Symplectic Elements at OxfordAssociation for Computing Machinery2017Kharlamov, EGiacomelli, LSherkhonov, EGrau, BKostylev, EVHorrocks, IFaceted search is a prominent search paradigm that became the standard in many Web applications and has also been recently proposed as a suitable paradigm for exploring and querying RDF graphs. One of the main challenges that hampers usability of faceted search systems especially in the RDF context is information overload, that is, when the size of faceted interfaces becomes comparable to the size of the data over which the search is performed. In this demo we present (an extension of) our faceted search system SemFacet and focus on features that address the information overload: ranking, aggregation, and reachability. The demo attendees will be able to try our system on an RDF graph that models online shopping over a catalogs with up to millions of products. |
| spellingShingle | Kharlamov, E Giacomelli, L Sherkhonov, E Grau, B Kostylev, EV Horrocks, I SemFacet: Making hard faceted search easier |
| title | SemFacet: Making hard faceted search easier |
| title_full | SemFacet: Making hard faceted search easier |
| title_fullStr | SemFacet: Making hard faceted search easier |
| title_full_unstemmed | SemFacet: Making hard faceted search easier |
| title_short | SemFacet: Making hard faceted search easier |
| title_sort | semfacet making hard faceted search easier |
| work_keys_str_mv | AT kharlamove semfacetmakinghardfacetedsearcheasier AT giacomellil semfacetmakinghardfacetedsearcheasier AT sherkhonove semfacetmakinghardfacetedsearcheasier AT graub semfacetmakinghardfacetedsearcheasier AT kostylevev semfacetmakinghardfacetedsearcheasier AT horrocksi semfacetmakinghardfacetedsearcheasier |