| 000 | 08021nam a22007571i 4500 | ||
|---|---|---|---|
| 001 | 8436569 | ||
| 003 | IEEE | ||
| 005 | 20200413152927.0 | ||
| 006 | m eo d | ||
| 007 | cr cn |||m|||a | ||
| 008 | 180829s2018 caua foab 000 0 eng d | ||
| 020 |
_a9781681733777 _qebook |
||
| 020 |
_z9781681733784 _qhardcover |
||
| 020 |
_z9781681733760 _qpaperback |
||
| 024 | 7 |
_a10.2200/S00855ED1V01Y201805DTM047 _2doi |
|
| 035 | _a(CaBNVSL)swl000408650 | ||
| 035 | _a(OCoLC)1050333829 | ||
| 040 |
_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL |
||
| 050 | 4 |
_aQA166 _b.B464 2018 |
|
| 082 | 0 | 4 |
_a511.5 _223 |
| 100 | 1 |
_aBhowmick, Sourav S., _eauthor. |
|
| 245 | 1 | 0 |
_aHuman interaction with graphs : _ba visual querying perspective / _cSourav S. Bhowmick, Byron Choi, Chengkai Li. |
| 264 | 1 |
_a[San Rafael, California] : _bMorgan & Claypool, _c2018. |
|
| 300 |
_a1 PDF (xxii, 186 pages) : _billustrations. |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_aelectronic _2isbdmedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 490 | 1 |
_aSynthesis lectures on data management, _x2153-5426 ; _v# 47 |
|
| 538 | _aMode of access: World Wide Web. | ||
| 538 | _aSystem requirements: Adobe Acrobat Reader. | ||
| 500 | _aPart of: Synthesis digital library of engineering and computer science. | ||
| 504 | _aIncludes bibliographical references (pages 177-184). | ||
| 505 | 0 | _a1. Introduction -- 1.1 Interaction with graphs using queries -- 1.2 Graph query construction using visual interfaces -- 1.3 Integration of visual query interface and query engine -- 1.4 Overview of this book -- 1.5 Scope -- | |
| 505 | 8 | _a2. Background -- 2.1 Graph terminology -- 2.1.1 Subgraph isomorphism-related terminology -- 2.1.2 Types of graph collection -- 2.1.3 Frequent and infrequent features -- 2.2 Visual graph query interface -- 2.2.1 Structure of visual graph query interfaces -- 2.2.2 Visual graph query formulation -- 2.2.3 Query formulation-related terminology -- 2.3 Summary -- | |
| 505 | 8 | _a3. Guidance for visual query formulation -- 3.1 Overview of AutoG -- 3.2 Query composition -- 3.2.1 Definition -- 3.2.2 Query autocompletion modes -- 3.2.3 C-prime features -- 3.3 Autocompletion framework in AutoG -- 3.3.1 Query decomposition -- 3.3.2 Generation of candidate suggestions -- 3.3.3 Ranking candidate suggestions -- 3.4 Indexed autocompletion-AutoGI -- 3.4.1 Feature DAG (FDAG) index -- 3.4.2 Autocompletion by using FDAG -- 3.5 Performance study -- 3.5.1 Suggestion quality -- 3.5.2 Efficiency -- 3.6 Guidance for queries over large networks -- 3.7 Bibliographic notes -- 3.8 Conclusion -- | |
| 505 | 8 | _a4. Blending human interactions and graph query processing -- 4.1 Visual substructure search problem -- 4.2 A unified framework -- 4.2.1 The framework -- 4.2.2 Generality of the framework -- 4.2.3 An instantiation -- 4.3 Action-aware indexing -- 4.3.1 Key features of action-aware index -- 4.3.2 Action-aware frequent (A2F) index -- 4.3.3 Action-aware infrequent (A2 I) index -- 4.4 Spindle-shaped graph (SPIG) -- 4.4.1 Algorithm for SPIG construction -- 4.4.2 Analysis of SPIG construction -- 4.5 Substructure similarity search -- 4.5.1 Exact substructure candidates set generation -- 4.5.2 Similar substructure candidates set generation -- 4.5.3 Generation of approximate query results -- 4.6 Supporting query modification -- 4.7 Performance study -- 4.7.1 Experimental setup -- 4.7.2 Performance on real graph dataset -- 4.7.3 Performance on synthetic graph dataset -- 4.8 Bibliographic notes -- 4.9 Conclusions -- | |
| 505 | 8 | _a5. Blending interactions and query processing on large networks -- 5.1 Overview and contributions -- 5.1.1 Visual substructure search problem revisited -- 5.1.2 Overview -- 5.2 Decomposition of a large network -- 5.2.1 Graphlets and adjacent graphlets -- 5.2.2 Supergraphlets -- 5.3 Indexing frequent and infrequent fragments -- 5.3.1 Frequent and infrequent fragments -- 5.3.2 Fragment join -- 5.3.3 Generation of frequent fragments and SIFs -- 5.3.4 Index construction -- 5.4 Graphlet-based SPIG -- 5.4.1 Structure of G-SPIG -- 5.4.2 Algorithm -- 5.5 Blending visual subgraph query -- 5.5.1 Candidate data graphs generation -- 5.5.2 Generation of query results -- 5.6 Performance study -- 5.6.1 Experimental setup -- 5.6.2 System response time (SRT) -- 5.6.3 Index size -- 5.6.4 Prefetching time -- 5.6.5 Performance on a million-nodes network -- 5.7 Bibliographic notes -- 5.8 Conclusions -- | |
| 505 | 8 | _a6. Human interaction with query results -- 6.1 Results exploration for small- or medium-sized data graphs -- 6.1.1 Picasso -- 6.2 Results exploration on large networks -- 6.2.1 Region-based exploration -- 6.2.2 Exemplar-based exploration -- 6.2.3 Feature-based exploration -- 6.3 Bibliographic notes -- 6.4 Conclusions -- | |
| 505 | 8 | _a7. Simulation of visual subgraph query formulation -- 7.1 Overview of visual -- 7.2 Index-based generation of subgraph queries -- 7.3 Quantitative modeling of visual query formulation -- 7.3.1 Modeling query formulation time -- 7.3.2 Model extensibility -- 7.4 Simulation of visual subgraph query construction -- 7.4.1 Graph representation of query formulation -- 7.4.2 The visual algorithm -- 7.4.3 Finding minimal and maximal QFS -- 7.5 Performance study -- 7.5.1 Performance of test subgraph query generation -- 7.5.2 Performance of the query formulation model and visual -- 7.5.3 Application of visual -- 7.6 Bibliographic notes -- 7.7 Conclusions -- | |
| 505 | 8 | _a8. The road ahead -- 8.1 Summary -- 8.2 Future research -- Bibliography -- Authors' biographies. | |
| 506 | _aAbstract freely available; full-text restricted to subscribers or individual document purchasers. | ||
| 510 | 0 | _aCompendex | |
| 510 | 0 | _aINSPEC | |
| 510 | 0 | _aGoogle scholar | |
| 510 | 0 | _aGoogle book search | |
| 520 | 3 | _aInteracting with graphs using queries has emerged as an important research problem for real-world applications that center on large graph data. Given the syntactic complexity of graph query languages (e.g., SPARQL, Cypher), visual graph query interfaces make it easy for nonprogrammers to query such graph data repositories. In this book, we present recent developments in the emerging area of visual graph querying paradigm that bridges traditional graph querying with human computer interaction (HCI). Specifically, we focus on techniques that emphasize deep integration between the visual graph query interface and the underlying graph query engine. We discuss various strategies and guidance for constructing graph queries visually, interleaving processing of graph queries and visual actions, visual exploration of graph query results, and automated performance study of visual graph querying frameworks. In addition, this book highlights open problems and new research directions. In summary, in this book, we review and summarize the research thus far into the integration of HCI and graph querying to facilitate user-friendly interaction with graph-structured data, giving researchers a snapshot of the current state of the art in this topic, and future research directions. | |
| 530 | _aAlso available in print. | ||
| 588 | _aTitle from PDF title page (viewed on August 29, 2018). | ||
| 650 | 0 |
_aGraph theory _xData processing. |
|
| 650 | 0 | _aQuerying (Computer science) | |
| 650 | 0 | _aHuman-computer interaction. | |
| 653 | _agraph querying | ||
| 653 | _ahuman-data interaction | ||
| 653 | _adeep integration | ||
| 653 | _avisual query formulation | ||
| 653 | _avisual query interface | ||
| 653 | _aquery processing | ||
| 653 | _aresults exploration | ||
| 653 | _aperformance benchmarking | ||
| 700 | 1 |
_aChoi, Byron, _eauthor. |
|
| 700 | 1 |
_aLi, Chengkai, _eauthor. |
|
| 776 | 0 | 8 |
_iPrint version: _z9781681733760 _z9781681733784 |
| 830 | 0 | _aSynthesis digital library of engineering and computer science. | |
| 830 | 0 |
_aSynthesis lectures on data management ; _v# 47. _x2153-5426 |
|
| 856 | 4 | 2 |
_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/servlet/opac?bknumber=8436569 |
| 999 |
_c562313 _d562313 |
||