Information Discovery on Graph-Structured Databases
7 Angebote vergleichen
Bester Preis: € 59,90 (vom 03.08.2016)1
Information Discovery on Graph-Structured Databases
DE PB NWISBN: 9783659839351 bzw. 3659839353, in Deutsch, Scholar'S Press, Taschenbuch, neu.
Lieferung aus: Deutschland, Versandkosten nach: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, buecher.de GmbH & Co. KG, [1].
Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques. 2016. 116 S. 220 mm Versandfertig in 3-5 Tagen, Softcover, Neuware.
Von Händler/Antiquariat, buecher.de GmbH & Co. KG, [1].
Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques. 2016. 116 S. 220 mm Versandfertig in 3-5 Tagen, Softcover, Neuware.
2
Symbolbild
Information Discovery on Graph-Structured Databases (2016)
DE PB NW RPISBN: 9783659839351 bzw. 3659839353, in Deutsch, SPS Jun 2016, Taschenbuch, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Neuware - Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques. 116 pp. Englisch.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, Germany.
This item is printed on demand - Print on Demand Neuware - Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques. 116 pp. Englisch.
3
Information Discovery on Graph-Structured Databases
DE HC NWISBN: 9783659839351 bzw. 3659839353, in Deutsch, Scholar´S Press, gebundenes Buch, neu.
Lieferung aus: Deutschland, Versandkostenfrei innerhalb von Deutschland.
Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques. Lieferzeit 1-2 Werktage.
Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques. Lieferzeit 1-2 Werktage.
4
Symbolbild
Information Discovery on Graph-Structured Databases (2016)
DE PB NW RPISBN: 9783659839351 bzw. 3659839353, in Deutsch, Sps, Taschenbuch, neu, Nachdruck.
Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, English-Book-Service Mannheim [1048135], Mannheim, Germany.
This item is printed on demand for shipment within 3 working days.
Von Händler/Antiquariat, English-Book-Service Mannheim [1048135], Mannheim, Germany.
This item is printed on demand for shipment within 3 working days.
5
Information Discovery on Graph-Structured Databases
~EN PB NWISBN: 3659839353 bzw. 9783659839351, vermutlich in Englisch, Scholars' Press, Taschenbuch, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…