M
Marcus Fontoura
Researcher at Microsoft
Publications - 125
Citations - 4048
Marcus Fontoura is an academic researcher from Microsoft. The author has contributed to research in topics: Set (abstract data type) & Inverted index. The author has an hindex of 33, co-authored 122 publications receiving 3606 citations. Previous affiliations of Marcus Fontoura include Princeton University & Google.
Papers
More filters
Patent
Using intra-document indices to improve XQuery processing over XML streams
TL;DR: In this article, a system and method for parsing documents in query processing comprises producing at least one index of a document written in a mark-up language, corresponding the index to the document, scanning the document and selectively skipping portions of the document based on instructions from the index.
Patent
Serving Advertisements with a Webpage Based on a Referrer Address of the Webpage
TL;DR: In this paper, an advertisement request mechanism for selecting advertisements to serve to a client requesting a primary webpage is presented. But the advertisement server uses the content of the primary webpage to select the one or more advertisements.
Journal ArticleDOI
Relaxation in text search using taxonomies
Marcus Fontoura,Vanja Josifovski,Ravi Kumar,Christopher Olston,Andrew Tomkins,Sergei Vassilvitskii +5 more
TL;DR: A novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions that may be relaxed at a cost to result quality, applicable in many arenas, including multifaceted, product, and local search.
Patent
Rule-based method and system for managing heterogenous computer clusters
TL;DR: In this paper, a system and method for managing heterogenous clusters asynchronously accesses operating information received from the clusters by invoking services on the clusters to send the necessary information, which is then evaluated against rules supplied by the clusters.
Patent
Running XPath queries over XML streams with incremental predicate evaluation
TL;DR: In this paper, a method that eagerly evaluates predicates of XPath queries over XML document nodes for a set of commonly known functions and operators (including arithmetic, general comparison, value comparison, Boolean operators, etc.) without materializing sequences is discussed.