Sciweavers

1310 search results - page 162 / 262
» Parameterized Partial Evaluation
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
15 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
WWW
2007
ACM
15 years 10 months ago
Identifying and discriminating between web and peer-to-peer traffic in the network core
Traffic classification is the ability to identify and categorize network traffic by application type. In this paper, we consider the problem of traffic classification in the netwo...
Jeffrey Erman, Anirban Mahanti, Martin F. Arlitt, ...
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
15 years 10 months ago
Cost-Sensitive Reordering of Navigational Primitives
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
Carl-Christian Kanne, Matthias Brantner, Guido Moe...
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
15 years 10 months ago
Temporal Coalescing with Now, Granularity, and Incomplete Information
This paper presents a novel strategy for temporal coalescing. Temporal coalescing merges the temporal extents of value-equivalent tuples. A temporal extent is usually coalesced of...
Curtis E. Dyreson
EDBT
2008
ACM
202views Database» more  EDBT 2008»
15 years 10 months ago
BeMatch: a platform for matchmaking service behavior models
The capability to easily find useful services (software applications, software components, scientific computations) becomes increasingly critical in several fields. Current approa...
Juan Carlos Corrales, Daniela Grigori, Mokrane Bou...