-
A hybrid approach for estimating document frequencies in unstructured P2P networks
Publication year: 2010
Source: Information Systems, In Press, Accepted Manuscript, Available online 3 September 2010
Robert, Neumayer , Christos, Doulkeridis , Kjetil, Nørvåg
Scalable search and retrieval over numerous web document collections distributed across different sites can be achieved by adopting a peer-to-peer (P2P) communication model. Terms and their document frequencies are the main components of text information retrieval and as such need to be computed, aggregated, and distributed throughout the system. This is a challenging problem in the context of unstructured P2P networks, since the local document collections may not reflect the global collection in an accurate way. This might happen due to skews in the distribution of documents to peers. Moreover, central assembly of the total information is not a scalable...
-
A framework for corroborating answers from multiple web sources
Publication year: 2010
Source: Information Systems, In Press, Accepted Manuscript, Available online 3 September 2010
Minji, Wu , Amélie, Marian
Search engines are increasingly efficient at identifying the best sources for any given keyword query, and are often able to identify the answer within the sources. Unfortunately, many web sources are not trustworthy, because of erroneous, misleading, biased, or outdated information. In many cases, users are not satisfied with the results from any single source. In this paper, we propose a framework to aggregate query results from different sources in order to save users the hassle of individually checking query-related web sites to corroborate answers. To return the best answers to the users, we assign a score to each individual...
-
Knowledge-based sense disambiguation (almost) for all structures
Publication year: 2010
Source: Information Systems, In Press, Accepted Manuscript, Available online 30 August 2010
Federica, Mandreoli , Riccardo, Martoglia
Structural disambiguation is acknowledged as a very real and frequent problem for many semantic-aware applications. In this paper, we propose a unified answer to sense disambiguation on a large variety of structures both at data and metadata level such as relational schemas, XML data and schemas, taxonomies, and ontologies. Our knowledge-based approach achieves general applicability by converting the input structures into a common format and by allowing users to tailor the extraction of the context to the specific application needs and structure characteristics. Flexibility is ensured by supporting the combination of different disambiguation methods together with different information extracted from...
-
Collection trees for event-monitoring queries
Publication year: 2010
Source: Information Systems, In Press, Accepted Manuscript, Available online 26 August 2010
Antonios, Deligiannakis , Yannis, Kotidis , Vassilis, Stoumpos , Alex, Delis
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries in a wireless sensor network. While prior techniques base their operation on the assumption that the sensor nodes that collect data relevant to a specified query need to include their measurements in the query result at every query epoch, in many event monitoring applications such an assumption is not valid. We introduce and formalize the notion of event monitoring queries and demonstrate that they can capture a large class of monitoring applications. We then show...
-
Demaq/TransScale: Automated Distribution and Scalability for Declarative Applications
Publication year: 2010
Source: Information Systems, In Press, Accepted Manuscript, Available online 12 August 2010
Alexander, Böhm , Carl-Christian, Kanne
The goal of the Demaq/TransScale system is to automate the distribution of applications to multiple hosts. Today, in order to create highly scalable architectures, developers have to manually restructure the application logic, creating balanced application fragments and data partitions to distribute across the available host machines. Our approach automates much of this manual work. We show how a novel, messaging-based programming model allows to implement distribution as a source-level transformation that turns a non-distributed application specification into a set of programs that can be executed on the various machines of a cluster. The challenge is the identification of application fragments...
|
Sindicacion 