Nothing Special   »   [go: up one dir, main page]

An Entity of Type: Rule105846932, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP).

Property Value
dbo:abstract
  • Range Minimum Queries (RMQs) adressieren innerhalb der Informatik das Problem, eine Anfrage nach dem kleinsten Element innerhalb eines spezifizierten Bereichs eines Arrays zu beantworten. Eine effiziente Beantwortung hat Relevanz für weitere Probleme der Informatik, wie z. B. für die Textindizierung und -kompression, Flussgraphen etc. (de)
  • In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP). (en)
  • 范围最值查询(英語:Range Minimum Query),是针对数据集的一种条件查询。若给定一个数组,范围最值查询指定一个范围条件到,要求取出中最大/小的元素。 若,条件为的范围最值查询返回1,它是子数组中最小的元素。 通常情况下,数组A是静态的,即元素不会变化,例如插入、删除和修改等,而所有的查询是以在线的方式给出的,即预先并不知道所有查询的参数。 RMQ问题有预处理之后每次查询的算法。 范围最值查询问题(RMQ)与最近公共祖先(LCA)问题有直接联系,它们可以互相转化。RMQ的算法常常应用在严格或者近似子串匹配等问题的处理中。 (zh)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 21332467 (xsd:integer)
dbo:wikiPageLength
  • 13729 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1111750296 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • Range Minimum Queries (RMQs) adressieren innerhalb der Informatik das Problem, eine Anfrage nach dem kleinsten Element innerhalb eines spezifizierten Bereichs eines Arrays zu beantworten. Eine effiziente Beantwortung hat Relevanz für weitere Probleme der Informatik, wie z. B. für die Textindizierung und -kompression, Flussgraphen etc. (de)
  • In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP). (en)
  • 范围最值查询(英語:Range Minimum Query),是针对数据集的一种条件查询。若给定一个数组,范围最值查询指定一个范围条件到,要求取出中最大/小的元素。 若,条件为的范围最值查询返回1,它是子数组中最小的元素。 通常情况下,数组A是静态的,即元素不会变化,例如插入、删除和修改等,而所有的查询是以在线的方式给出的,即预先并不知道所有查询的参数。 RMQ问题有预处理之后每次查询的算法。 范围最值查询问题(RMQ)与最近公共祖先(LCA)问题有直接联系,它们可以互相转化。RMQ的算法常常应用在严格或者近似子串匹配等问题的处理中。 (zh)
rdfs:label
  • Range Minimum Query (de)
  • Range minimum query (en)
  • 范围最值查询 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License