Matches in ScholarlyData for { ?s ?p ?o. }
- item-1 type ListItem.
- item-1 hasContent yuting-liu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent tie-yan-liu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent tao-qin.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent zhiming-ma.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent hang-li.
- item-5 previous item-4.
- 287 creator peter-froehlich.
- 287 creator rainer-simon.
- 287 type InProceedings.
- 287 label "A Mobile Application Framework for the Geospatial Web".
- 287 sameAs 287.
- 287 abstract "In this paper we present an application framework that leverages geospatial content on the World Wide Web by enabling innovative modes of interaction and novel types of user interfaces on advanced mobile phones and PDAs. We discuss the current development steps involved in building mobile geospatial Web applications and derive three technological pre-requisites for our framework: spatial query operations based on visibility and field of view, a 2.5D environment model, and a presentation-independent data exchange format for geospatial query results. We propose the Local Visibility Model as a suitable XML-based candidate and present a prototype implementation.".
- 287 hasAuthorList authorList.
- 287 isPartOf proceedings.
- 287 title "A Mobile Application Framework for the Geospatial Web".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent rainer-simon.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent peter-froehlich.
- item-2 previous item-1.
- 308 creator guillaume-pierre.
- 308 creator swaminathan-sivasubramanian.
- 308 creator tobias-groothuyse.
- 308 type InProceedings.
- 308 label "GlobeTP: Template-Based Database Replication for Scalable Web Applications".
- 308 sameAs 308.
- 308 abstract "Generic database replication algorithms do not scale linearly in throughput as they require to apply all update, deletion and insertion (UDI) queries to every database replica. The throughput is therefore limited to the point where the number of UDI queries alone is sufficient to overload one server. In such scenarios, partial replication of a database can help, as update queries are executed only by a subset of all servers. In this paper we propose GlobeTP, a system that employs partial replication to improve database throughput. GlobeTP exploits the fact that a Web application's query workload is composed of a small set of read and write templates. Using knowledge of these templates and their respective execution costs, GlobeTP provides database table placements that produce significant improvements in database throughput. We demonstrate the efficiency of this technique using two different industry standard benchmarks. In our experiments, GlobeTP increases the throughput by 57% to 150% compared to full replication, while using identical hardware configuration. Furthermore, adding a single query cache improves the throughput by another 30% to 60%.".
- 308 hasAuthorList authorList.
- 308 isPartOf proceedings.
- 308 title "GlobeTP: Template-Based Database Replication for Scalable Web Applications".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent tobias-groothuyse.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent swaminathan-sivasubramanian.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent guillaume-pierre.
- item-3 previous item-2.
- 324 creator soumen-chakrabarti.
- 324 type InProceedings.
- 324 label "Dynamic Personalized Pagerank in Entity-Relation Graphs".
- 324 sameAs 324.
- 324 abstract "Extractors and taggers turn unstructured text into entity-relation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, cited, works-for). Typed proximity search of the form type=person NEAR company~"IBM", paper~"XML" is an increasingly useful search paradigm in ER graphs. Proximity search implementations either perform a Pagerank-like computation at query time, which is slow, or precompute, store and combine per-word Pageranks, which can be very expensive in terms of preprocessing time and space. We present HubRank, a new system for fast, dynamic, space-efficient proximity searches in ER graphs. During preprocessing, HubRank computes and indexes certain "sketchy" random walk fingerprints for a small fraction of nodes, carefully chosen using query log statistics. At query time, a small "active" subgraph is identified, bordered by nodes with indexed fingerprints. These fingerprints are adaptively loaded to various resolutions to form approximate personalized Pagerank vectors (PPVs). PPVs at remaining active nodes are now computed iteratively. We report on experiments with CiteSeer's ER graph and millions of real CiteSeer queries. Some representative numbers follow. On our testbed, HubRank preprocesses and indexes 52 times faster than whole-vocabulary PPV computation. A text index is 56 MB. Whole-vocabulary PPVs would consume 102 GB. If PPVs are truncated to 56 MB, precision compared to true Pagerank drops to 0.55; in contrast, HubRank has precision 0.91 at 63 MB. HubRank's average query time is 328 milliseconds; query-time Pagerank computation takes 11 seconds on average.".
- 324 hasAuthorList authorList.
- 324 isPartOf proceedings.
- 324 title "Dynamic Personalized Pagerank in Entity-Relation Graphs".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent soumen-chakrabarti.
- 326 creator carmine-gravino.
- 326 creator emilia-mendes.
- 326 creator filomena-ferrucci.
- 326 creator sergio-di-martino.
- 326 type InProceedings.
- 326 label "Effort Estimation: How Valuable is it for a Web company to Use a Cross-company Data Set, Compared to Using Its Own Single-company Data Set?".
- 326 sameAs 326.
- 326 abstract "Previous studies comparing the prediction accuracy of effort models built using Web cross- and single-company data sets have been inconclusive, and as such replicated studies are necessary to determine under what circumstances a company can place reliance on a cross-company effort model. This paper therefore replicates a previous study by investigating how successful a cross-company effort model is: i) to estimate effort for Web projects that belong to a single company and were not used to build the cross-company model; ii) compared to a single-company effort model. Our single-company data set had data on 15 Web projects from a single company and our cross-company data set had data on 68 Web projects from 25 different companies. The effort estimates used in our analysis were obtained by means of two effort estimation techniques, namely forward stepwise regression and case-based reasoning. Our results were similar to those from the replicated study, showing that predictions based on the single-company model were significantly more accurate than those based on the cross-company model.".
- 326 hasAuthorList authorList.
- 326 isPartOf proceedings.
- 326 title "Effort Estimation: How Valuable is it for a Web company to Use a Cross-company Data Set, Compared to Using Its Own Single-company Data Set?".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent emilia-mendes.
- item-1 next item-2.
- item-2 type ListItem.