description: a method of structuring data to enable interlinking and become more useful through semantic queries
62 results
by Belinda Barnet · 14 Jul 2013 · 193pp · 19,478 words
in Storyspace were called ‘writing spaces’, and it worked explicitly with topographic MACHINE-ENHANCED (RE)MINDING 121 metaphors, incorporating a graphic ‘map view’ of the link data structure from the first version, along with a tree and an outline view (which are also visual representations of the data). ‘The tree’, Bolter tells
by Donald Ervin Knuth · 15 Jan 1998
in a practical range; as N —> oo this number can be lowered to order N(\ogNJ. Another way to improve on Algorithm S, using a linked data structure, gave us the list insertion method, which does about \N2 comparisons, 0 moves, and 2N changes of links. Is it possible to marry the
…
representation. We know that linked allocation is specifically designed to handle a set of tables of variable size, so it is natural to choose a linked data structure for radix sorting. Since we traverse each pile serially, all 5.2.5 SORTING BY DISTRIBUTION 171 Table 1 RADIX SORTING Input area contents
by Donald E. Knuth · 1 Jan 1974
computers require an entirely different approach to subroutine libraries. But this is a nice exercise anyway, because it involves interesting manipulations on both sequential and linked data.) The problem in this exercise is to design an algorithm for the stated task. Your allocator may transform the tape directory in any way as
by Eric Redmond, Jim Wilson and Jim R. Wilson · 7 May 2012 · 713pp · 93,944 words
discuss the most popular graph database today, Neo4J. Neo4J One operation where other databases often fall flat is crawling through self-referential or otherwise intricately linked data. This is exactly where Neo4J shines. The benefit of using a graph database is the ability to quickly traverse nodes and relationships to find relevant
…
'{"room" : 101}' What makes Links special in Riak is link walking (and a more powerful variant, linked mapreduce queries, which we investigate tomorrow). Getting the linked data is achieved by appending a link spec to the URL that is structured like this: /_,_,_. The underscores (_) in the URL represent wildcards to each of
by Mehmed Kantardzić · 2 Jan 2003 · 721pp · 197,134 words
contacts, or in bibliographic domains describing publications, authors, and venues. Graph-mining techniques explicitly consider these links when building predictive or descriptive models of the linked data. The requirement of different applications with graph-based data sets is not very uniform. Thus, graph models and mining algorithms that work well in one
…
given in Figure 12.2b, while the graph in Figure 12.2c is a labeled graph. Different applications use different types of graphs in modeling linked data. In this chapter the primary focus is on undirected and unlabeled graphs although the reader still has to be aware that there are numerous graph
by Tony Norfield · 352pp · 98,561 words
of securities between UK-based banks and the rest of the world are intermediated by banks outside the UK, but many of these are UK-linked. Data from the Bank of England enable these links to be examined in some detail, and they highlight a key role of the UK banking system
by Alex Wright · 6 Jun 2014
the company to Google, where its structured snippets now often complement traditional keyword-based search results. In recent years, the Linked Data movement has to some extent subsumed the Semantic Web initiative. Linked Data proposes more of a middle ground, in which ontologies might be derived programmatically from analyzing large data sets, rather than
…
Library of Congress, 20, 29, 37 Licklider, J. C. R., 15, 248–250, 251, 258, 259 Limited Company for Useful Knowledge, 46 Limousin, Charles, 76 Linked Data movement, 278 Linotype, 89, 91, 92 Lippman, Walter, 162 Literary Machines (Nelson), 266 Lodge, Henry Cabot, 148, 165 Lovelace, Ada, 15 Lumière brothers, 62 Macintosh
…
, 4, 5, 7, 13, 245 World Wide Web. See also Internet flatness of, 285, 303 fundamental disorder of, 253–254, 282, 305 Knowledge Web, 276 Linked Data movement, 278 negatives of structure of, 272, 281, 289–291 ongoing development of, 280, 291 openness of, 271–272, 279, 281, 283, 285 origins of
by Richard Watson · 1 Jan 2008
also see mood-sensitive vehicles that adjust their behavior according to the mood of the driver or occupants. Cars will also become mobile technology platforms linking data to other services such as healthcare. For example, if your car regularly detects an abnormal heartbeat or high levels of stress, this information could be
by Lawrence Lessig · 14 Jul 2001 · 494pp · 142,285 words
support the costs of developing and maintaining this information. And in some cases, with some databases, the Internet provided a simple way to collect and link data about music in particular.8 Here the CDDB—or “CD database”—is the most famous example. As MP3 equipment became common, people needed a simple
by Robert Sedgewick · 2 Jan 1992
of applications of two-dimensional arrays and linked lists, and in Chapter 5 to illustrate the relationship between recursive programs and fundamental data structures. Any linked data structure is a representation of a graph, and some familiar algorithms for processing trees and other linked structures are special cases of graph algorithms. The
…
lists and vectors to represent the set of vertices incident on each vertex. Thus, we see again that an understanding of the basic properties of linked data structures and vectors is critical if we are to develop efficient graph ADT implementations. Our interest in these performance differences is that we want to
by Sara Wachter-Boettcher · 28 Nov 2012 · 245pp · 68,420 words
by Peter F. Hamilton · 1 Jan 2008 · 897pp · 242,580 words
by Jiawei Han, Micheline Kamber and Jian Pei · 21 Jun 2011
by Julie Steele · 20 Apr 2010
by Jonathan Gray, Lucy Chambers and Liliana Bounegru · 9 May 2012
by Shoshana Zuboff · 15 Jan 2019 · 918pp · 257,605 words
by David Weinberger · 14 Jul 2011 · 369pp · 80,355 words
by John Courtenay Grimwood · 15 Nov 2001
by Shoshana Zuboff · 14 Apr 1988
by Benjamin H. Bratton · 19 Feb 2016 · 903pp · 235,753 words
by Kevin Kelly · 6 Jun 2016 · 371pp · 108,317 words
by Eric Enge, Stephan Spencer, Jessie Stricchiola and Rand Fishkin · 7 Mar 2012
by Ray Kurzweil · 14 Jul 2005 · 761pp · 231,902 words
by Douglas R. Dechow · 2 Jul 2015 · 223pp · 52,808 words
by Amy Brown and Greg Wilson · 24 May 2011 · 834pp · 180,700 words
by Rob Kitchin · 25 Aug 2014
by James Higginbotham · 20 Dec 2021 · 283pp · 78,705 words
by Olivier Cure and Guillaume Blin · 10 Dec 2014
by Nicola Twilley · 24 Jun 2024 · 428pp · 125,388 words
by Bob Ducharme · 15 Jul 2011 · 315pp · 70,044 words
by Tom White · 29 May 2009 · 933pp · 205,691 words
by Gary Marcus and Jeremy Freeman · 1 Nov 2014 · 336pp · 93,672 words
by Ian Robinson, Jim Webber and Emil Eifrem · 13 Jun 2013 · 201pp · 63,192 words
by Paul Vigna and Michael J. Casey · 27 Feb 2018 · 348pp · 97,277 words
by Bruce Schneier · 2 Mar 2015 · 598pp · 134,339 words
by Donald MacKenzie · 24 May 2021 · 400pp · 121,988 words
by Adrian Hon · 14 Sep 2022 · 371pp · 107,141 words
by Tim Berners-Lee · 8 Sep 2025 · 347pp · 100,038 words
by Rob Kitchin,Tracey P. Lauriault,Gavin McArdle · 2 Aug 2017
by Ariel Ezrachi and Maurice E. Stucke · 30 Nov 2016
by Ruthanna Emrys · 25 Jul 2022 · 431pp · 127,720 words
by Emanuel Derman · 1 Jan 2004 · 313pp · 101,403 words
by Norman Matloff · 404pp · 43,442 words
by Martin Campbell-Kelly and Nathan Ensmenger · 29 Jul 2013 · 528pp · 146,459 words
by Bob Ducharme · 22 Jul 2011 · 511pp · 111,423 words
by Leslie Sikos · 10 Jul 2015
by Diomidis Spinellis and Georgios Gousios · 30 Dec 2008 · 680pp · 157,865 words
by Daniel Drescher · 16 Mar 2017 · 430pp · 68,225 words
by Diane Coyle · 15 Apr 2025 · 321pp · 112,477 words
by Kendall Kim · 31 May 2007 · 224pp · 13,238 words
by Douglas B. Laney · 4 Sep 2017 · 374pp · 94,508 words
by Howard G. Buffett · 2 Apr 2018 · 350pp · 109,521 words
by Nick Couldry and Ulises A. Mejias · 19 Aug 2019 · 458pp · 116,832 words
by Mike Dewar · 26 Jun 2012 · 100pp · 15,500 words
by Dan Bader · 14 Oct 2017 · 262pp · 60,248 words
by Frank J. Ohlhorst · 28 Nov 2012 · 133pp · 42,254 words
by Guy Shrubsole · 1 May 2019 · 505pp · 133,661 words
by Dan Bouk · 22 Aug 2022 · 424pp · 123,180 words
by Cathy O'Neil · 15 Mar 2022 · 318pp · 73,713 words
by Hans Rosling, Ola Rosling and Anna Rosling Rönnlund · 2 Apr 2018 · 288pp · 85,073 words
by Pete Warden · 20 Sep 2011 · 58pp · 12,386 words
by Carl Sagan · 8 Sep 1997 · 356pp · 102,224 words