Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arsany Sawires

dblp:78/3512 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
4 papers
Query processing and optimization · 35% Data models and query languages · 25% Data stream processing · 15%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
web information extraction
0.112009
Extracting data records from the web using tag path clustering · WWW 2009
Data stream processing
continuous query processing
0.112007
Mashup Feeds: : continuous queries over web services · SIGMOD Conference 2007
Data integration and cleaning
web service integration
0.112007
Mashup Feeds: : continuous queries over web services · SIGMOD Conference 2007
Query processing and optimization › view maintenance
incremental view maintenance
0.112005
Incremental Maintenance of Path Expression Views · SIGMOD Conference 2005
Query processing and optimization
materialized view
0.112005
Incremental Maintenance of Path Expression Views · SIGMOD Conference 2005
Query processing and optimization
view maintenance
0.112005
Incremental Maintenance of Path Expression Views · SIGMOD Conference 2005
Web and social media mining › web mining
web page structure analysis
0.012009
Extracting data records from the web using tag path clustering · WWW 2009

Methods — techniques the papers use, named apart from their topics

visual signal similarity · 0.2tag path clustering · 0.2stream processing semantics · 0.1incremental view maintenance · 0.1
YearPublicationVenuePosition
2010 CloudDB: One Size Fits All Revived
abstract
We present a data management platform in the cloud, CloudDB. The guiding principle of CloudDB’s design is establishing data independence for the applications that need to use diverse underlying data stores that are optimized for varying workload needs and characteristics. The applications should not have to be aware of the physical organization of the data and how the data is accessed. Ideally, an application only needs a logical specification of the data access layer and the data access requests are handled in a declarative way. CloudDB hosts variety of specialized databases that deliver high performance, scalability, and cost efficiency for varying application needs. CloudDB’s API layer is designed in such a way to give data independence to the higher level applications. The goal is to let the clients use just a simple, standard, and uniform language API to access data management functions as a service.
Hakan Hacigümüs, Jun'ichi Tatemura, Wang-Pin Hsiung, Hyun Jin Moon, Oliver Po, Arsany Sawires, Yun Chi, Hojjat Jafarpour
SERVICES6
2009 Extracting data records from the web using tag path clustering
abstract
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies a set of Web page segments, each of which represents an individual object (e.g., a product). State-of-the-art methods suffice for simple search, but they often fail to handle more complicated or noisy Web page structures due to a key limitation -- their greedy manner of identifying a list of records through pairwise comparison (i.e., similarity match) of consecutive segments. This paper introduces a new method for record extraction that captures a list of objects in a more robust way based on a holistic analysis of a Web page. The method focuses on how a distinct tag path appears repeatedly in the DOM tree of the Web document. Instead of comparing a pair of individual segments, it compares a pair of tag path occurrence patterns (called visual signals) to estimate how likely these two tag paths represent the same list of objects. The paper introduces a similarity measure that captures how closely the visual signals appear and interleave. Clustering of tag paths is then performed based on this similarity measure, and sets of tag paths that form the structure of data records are extracted. Experiments show that this method achieves higher accuracy than previous methods.
Gengxin Miao, Jun'ichi Tatemura, Wang-Pin Hsiung, Arsany Sawires, Louise E. Moser
WWW4
2007 Mashup Feeds: : continuous queries over web services
abstract
Mashup Feeds is a system that supports integrated web service feeds as continuous queries. We introduce collection-based stream processing semantics to enable information extraction by monitoring source evolution over time.
Jun'ichi Tatemura, Arsany Sawires, Oliver Po, Songting Chen, K. Selçuk Candan, Divyakant Agrawal, Maria Goveas
SIGMOD Conference2
2006 Maintaining XPath Views In Loosely Coupled Systems
Arsany Sawires, Jun'ichi Tatemura, Oliver Po, Divyakant Agrawal, Amr El Abbadi, K. Selçuk Candan
VLDB1
2005 WreC: A Scalable Middleware Architecture to Enable XML Caching for Web-Services
Jun'ichi Tatemura, Oliver Po, Arsany Sawires, Divyakant Agrawal, K. Selçuk Candan
Middleware3
2005 Incremental Maintenance of Path Expression Views
abstract
Caching data by maintaining materialized views typically requires updating the cache appropriately to reflect dynamic source updates. Extensive research has addressed the problem of incremental view maintenance for relational data but only few works have addressed it for semi-structured data. In this paper we address the problem of incremental maintenance of views defined over XML documents using path-expressions. The approach described in this paper has the following main features that distinguish it from the previous works: (1) The view specification language is powerful and standardized enough to be used in realistic applications. (2) The size of the auxiliary data maintained with the views depends on the expression size and the answer size regardless of the source data size.(3) No source schema is assumed to exist; the source data can be any general well-formed XML document. Experimental evaluation is conducted to assess the performance benefits of the proposed approach.
Arsany Sawires, Jun'ichi Tatemura, Oliver Po, Divyakant Agrawal, K. Selçuk Candan
SIGMOD Conference1