SocialScope: Enabling Information Discovery on Social Content Sites (2009)
Recently, many content sites have started encouraging their users to engage in social activities such as adding buddies on Yahoo! Travel and sharing articles with their friends on New York Times....
GalaTex: A Conformant Implementation of the XQuery Full-Text Language (2009)
Emiran Curtmola, Sihem Amer-yahia, Philip Brown, Mary Fernández
We describe GALATEX [10], the first complete implementation of XQuery Full-Text, a W3C specification that extends XPath 2.0 and XQuery 1.0 with full-text search capabilities. XQuery Full-Text...
SocialScope: Enabling Information Discovery on Social Content Sites (2009)
Amer-Yahia, Sihem, Lakshmanan, Laks, Yu, Cong
Recently, many content sites have started encouraging their users to engage in social activities such as adding buddies on Yahoo! Travel and sharing articles with their friends on New York Times....
One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries...
ABSTRACT Flexible and Efficient XML Search with Complex Full-Text Predicates (2008)
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity and order predicates...
Sihem Amer-yahia, Mariano Consens, Ricardo Baeza-yates, Mounia Lalmas
� DB focused on languages, expressiveness and efficient evaluation � IR focused on scoring and relevance metrics � In practice, p a limited set of operations p and simple ranking go a long way...
ABSTRACT A Comprehensive Solution to the XML-to-Relational Mapping Problem (2008)
The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable data management...
Adaptive Processing of Top-k Queries in XML Abstract (2008)
Amélie Marian, Sihem Amer-yahia
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies on using scores to...
XML Retrieval: DB/IR in Theory, Web in practice (2008)
Sihem Amer-yahia, Mariano P. Consens
Learning Objectives: Tutorial attendees will learn about requirements for combined DB and IR applications that access XML content; learn about models and indexes tailored to XML and their algorithms;...
Chavdar Botev, Sihem Amer-yahia
We demonstrate an XML full-text search engine that implements the TeXQuery language. TeXQuery is a powerful fulltext search extension to XQuery that provides a rich set of fully composable full-text...
Chavdar Botev, Sihem Amer-yahia, Jayavel Shanmugasundaram
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for full-text search...
ABSTRACT Flexible and Efficient XML Search with Complex Full-Text Predicates (2008)
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity and order predicates...
Sihem Amer-yahia, Divesh Srivastava
XML repositories are usually queried both on structure and content. Due to structural heterogeneity of XML, queries are often interpreted approximately and their answers are returned ranked by...
Personalizing XML Full Text Search in PIMENTO (2008)
Fundulaki, Irini, Amer-Yahia, Sihem, Laks, Lakshmanan
In PIMENTO we advocate a novel approach to XML search that leverages user information to return more relevant query answers. This approach is based on formalizing {em user profiles} in terms of {em...
08111 Report -- Ranked XML Querying (2008)
Amer-Yahia, Sihem, Hiemstra, Djoerd, Roelleke, Thomas, Srivastava, Divesh, Weikum, Gerhard
This paper is based on a five-day workshop on "Ranked XML Querying" that took place in Schloss Dagstuhl in Germany in March 2008 and was attended by 27 people from three different research...
08111 Abstracts Collection -- Ranked XML Querying (2008)
Amer-Yahia, Sihem, Srivastava, Divesh, Weikum, Gerhard
From 09.03. to 14.03.08, the Dagstuhl Seminar 08111 ``Ranked XML Querying'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several...
Databases and Web 2.0 panel at VLDB 2007 (2008)
Amer-Yahia, Sihem, Markl, Volker, Halevy, Alon, Doan, AnHai, Alonso, Gustavo, Kossmann, Donald, ...
Sihem Amer-yahia, Divesh Srivastava
XML permits the interleaving of text with structural and semantic markup in documents. Markup is added to a document by tagging a portion of the text or by augmenting the text with annotations. The...
Bulk Loading into Databases: a Declarative Approach (2007)
Sihem Amer-yahia, Sophie Cluet, Inria Rocquencourt
We present novel optimization techniques for bulk loading into databases. The aim of this work is to capture, understand and optimize different performance criteria (e.g., elapsed time, bandwidth,...
Tree Pattern Query Minimization (2007)
Sihem Amer-yahia, Sungran Cho, Divesh Srivastava
Tree patterns form a natural basis to query treestructured data such as XML and LDAP. To improve the efficiency of tree pattern matching, it is essential to quickly identify and eliminate redundant...
One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries...
Expressiveness and performance of full-text search languages (2006)
Chavdar Botev, Sihem Amer-yahia, Jayavel Shanmugasundaram
Abstract. We study the expressiveness and performance of full-text search languages. Our motivation is to provide a formal basis for comparing full-text search languages and to develop a model for...
Expressiveness and performance of full-text search languages (2006)
Chavdar Botev, Sihem Amer-yahia, Jayavel Shanmugasundaram
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for full-text search...
Expressiveness and performance of full-text search languages (2006)
Chavdar Botev, Sihem Amer-yahia, Jayavel Shanmugasundaram
Abstract. We study the expressiveness and performance of full-text search languages. Our motivation is to provide a formal basis for comparing full-text search languages and to develop a model for...
Expressiveness and Performance of Full-Text Search Languages (2005)
Botev, Chavdar, Amer-Yahia, Sihem, Shanmugasundaram, Jayavel
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for full-text search...
Expressiveness and Performance of Full-Text Search Languages (2005)
Botev, Chavdar, Amer-Yahia, Sihem, Shanmugasundaram, Jayavel
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for full-text search...
Expressiveness and Performance of Full-Text Search Languages (2005)
Botev, Chavdar, Amer-Yahia, Sihem, Shanmugasundaram, Jayavel
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and todevelop a model for full-text search...
Expressiveness and Performance of Full-Text Search Languages (2005)
Botev, Chavdar, Amer-Yahia, Sihem, Shanmugasundaram, Jayavel
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and todevelop a model for full-text search...
GalaTex: A Conformant Implementation of the XQuery Full-Text Language (2005)
Emiran Curtmola, Sihem Amer-yahia, Philip Brown, Mary Fernández
We descr i be GalaTex, the first complete implementation of XQuery Full-Text, a W3C specification that extends XPath 2.0 and XQuery 1.0 with full-text search. XQuery Full-Text provides composable...
Structure and Content Scoring for XML (2005)
Sihem Amer-yahia, Divesh Srivastava
XML repositories are usually queried both on structure and content. Due to structural heterogeneity of XML, queries are often interpreted approximately and their answers are returned ranked by...
Structure and Content Scoring for XML (2005)
Sihem Amer-yahia, Divesh Srivastava
XML repositories are usually queried both on structure and content. Due to structural heterogeneity of XML, queries are often interpreted approximately and their answers are returned ranked by...
Adaptive Processing of Top-k Queries in XML (2005)
Am Elie Marian, Amélie Marian, Sihem Amer-yahia
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies on using scores to...
XML Full-Text Search: Challenges and Opportunities (2005)
Sihem Amer-yahia, Jayavel Shanmugasundaram
rch in XML full-text search in DB and IR including languages, appropriate scoring and ranking methods, implementation architectures and query evaluation algorithms and, summarize open research issues...
Report on the db/ir panel at SIGMOD 2005 (2005)
Sihem Amer-yahia, Thomas Rölleke, Jayavel Shanmugasundaram, Gerhard Weikum
This paper summarizes the salient aspects of the SIGMOD 2005
GalaTex: A Conformant Implementation of the XQuery Full-Text Language. XIME-P (2005)
Emiran Curtmola, Sihem Amer-yahia, Philip Brown, Mary Fernández
and XQuery 1.0 with full-text search capabilities. XQuery FT provides composable full-text search primitives such as simple keyword search, Boolean queries, and keyword-distance predicates. GALATEX...
Report on the DB/IR panel at SIGMOD 2005 (2005)
Amer-Yahia, Sihem, Case, Pat, Rölleke, Thomas
This paper summarizes the salient aspects of the SIGMOD 2005 panel on "Databases and Information Retrieval: Rethinking the Great Divide". The goal of the panel was to discuss whether we should...
TeXQuery: A Full-Text Search Extension to XQuery (2004)
Amer-Yahia, Sihem, Botev, Chavdar, Shanmugasundaram, Jayavel
One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries...
Web-services architecture for efficient XML data exchange (2004)
Sihem Amer-yahia, Yannis Kotidis
Business applications often exchange large amounts of enterprise data stored in legacy systems. The advent of XML as a standard specification format has improved applications interoperability....
TeXQuery: A Full-Text Search Extension to XQuery (2004)
mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries over structured data, they can only express very rudimentary...
Teaching Relational Optimizers about XML Processing (2004)
Sihem Amer-yahia, Yannis Kotidis, Divesh Srivastava
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relational data....
Teaching Relational Optimizers about XML Processing (2004)
Sihem Amer-yahia, Yannis Kotidis, Divesh Srivastava
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relational data....
Sihem Amer-yahia, Luis Gravano, Sergey Brin, Taher Haveliwala, Jayavel Shanmugasundaram, Maha Abdallah, ...
FleXPath: Flexible structure and full-text querying for XML (2004)
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for querying XML documents...
On the Completeness of Full-Text Search Languages for XML (2003)
Botev, Chavdar, Amer-Yahia, Sihem, Shanmugasundaram, Jayavel
We study formal properties of full-text search languages for XML. Our main contribution is the development of a formal model for full-text search based on the positions of tokens in XML nodes....
On the Completeness of Full-Text Search Languages for XML (2003)
Botev, Chavdar, Amer-Yahia, Sihem, Shanmugasundaram, Jayavel
We study formal properties of full-text search languages for XML. Our main contribution is the development of a formal model for full-text search based on the positions of tokens in XML nodes....
TeXQuery: A Full-Text Search Extension to XQuery (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Shanmugasundaram, Jayavel
One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries...
TeXQuery: A Full-Text Search Extension to XQuery (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Shanmugasundaram, Jayavel
One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries...
TeXQuery: A Full-Text Search Extension to XQuery (Part III: Use Cases Solutions) (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Robie, Jonathan, Shanmugasundaram, Jayavel
This report describes the TeXQuery use cases solutions. TeXQuery is a full-text search extension to XQuery.
TeXQuery: A Full-Text Search Extension to XQuery (Part I: Language Specification) (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Robie, Jonathan, Shanmugasundaram, Jayavel
This report describes the TeXQuery language specification. TeXQuery is a full-text search extension to XQuery.
TeXQuery: A Full-Text Search Extension to XQuery (Part II: Formal Semantics) (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Robie, Jonathan, Shanmugasundaram, Jayavel
This report describes the formal semantics of TeXQuery. TeXQuery is a full-text search extension to XQuery.
TeXQuery: A Full-Text Search Extension to XQuery (Part III: Use Cases Solutions) (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Robie, Jonathan, Shanmugasundaram, Jayavel
This report describes the TeXQuery use cases solutions. TeXQuery is a full-text search extension to XQuery.
TeXQuery: A Full-Text Search Extension to XQuery (Part I: Language Specification) (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Robie, Jonathan, Shanmugasundaram, Jayavel
This report describes the TeXQuery language specification. TeXQuery is a full-text search extension to XQuery.
TeXQuery: A Full-Text Search Extension to XQuery (Part II: Formal Semantics) (2003)
Amer-Yahia, Sihem, Botev, Chavdar, Robie, Jonathan, Shanmugasundaram, Jayavel
This report describes the formal semantics of TeXQuery. TeXQuery is a full-text search extension to XQuery.
PIX: Exact and Approximate Phrase Matching in XML (2003)
Sihem Amer-yahia, Divesh Srivastava
INTRODUCTION XML permits the interleaving of text with structural and semantic markup in documents. Markup is added to a document by tagging a portion of the text or by augmenting the text with...
Data-Relaxation Strategies (2003)
1. Traditional query evaluation computes exact matches. 2. The set of approximate matches to a query is a result of computing exact matches to a set of queries, obtained by transforming the original...
Distributed Evaluation of Network Directory Queries (2003)
Sihem Amer-Yahia, Divesh Srivastava, Ieee Computer Society, Dan Suciu
This paper describes novel efficient techniques for the distributed evaluation of hierarchical aggregate selection queries over LDAP directory data, distributed across multiple autonomous directory...
Optimizing the secure evaluation of twig queries (2002)
Sungran Cho, Sihem Amer-yahia, Divesh Srivastava
The rapid emergence of XML as a standard for data exchange over the Web has led to considerable interest in the problem of securing XML documents. In this context, query eva]-uation engines need to...
Tree Pattern Relaxation (2002)
Sihem Amer-yahia, Sungran Cho, Divesh Srivastava
Tree patterns are fundamental to querying tree-structured data like XML. Because of the heterogeneity of XML data, it is often more appropriate to permit approximate query matching and return ranked...
Minimization of tree pattern queries (2001)
Sihem Amer-yahia, Sungran Cho, Divesh Srivastava
Tree patterns form a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the...
Minimization of Tree Pattern Queries (2001)
Sihem Amer-Yahia, Sungran Cho, Divesh Srivastava
Tree patterns form a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the...
Optimizing queries on compressed bitmaps (2000)
Sihem Amer-yahia, Theodore Johnson
Bitmap indices are used by DBMS's to accelerate decision support queries. A significant advantage of bitmap indices is that complex logical selection operations can be performed very quickly, by...
On bounding-schemas for LDAP directories (2000)
Sihem Amer-yahia, H. V. Jagadish, Divesh Srivastava
As our world gets more networked, ever increasing amounts of information---e.g., about people, network resources, and policies---are being stored in directories, in particular, in X.500 style...
On Bounding-Schemas for LDAP Directories (2000)
Sihem Amer-yahia, H. V. Jagadish, Divesh Srivastava
As our world gets more networked, ever increasing amounts of information---e.g., about people, network resources, and policies---are being stored in directories, in particular, in X.500 style...
On Bounding-Schemas for LDAP Directories (1999)
Sihem Amer-yahia, H. V. Jagadish, Divesh Srivastava
. As our world gets more networked, ever increasing amounts of information are being stored in LDAP directories. While LDAP directories have considerable flexibility in the modeling and retrieval of...
Bulk Loading Techniques for Object Databases and an Application to Relational Data (1998)
Sihem Amer-yahia, Sophie Cluet, Sophie Cluet, Claude Delobel
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelO0 whose targets are any ODBC...
Bulk Loading Techniques for Object Databases and an Application to Relational Data (1998)
Sihem Amer-yahia, Sophie Cluet, Claude Delobel
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelOO whose targets are any ODBC...
Bulk Loading Techniques for Object Databases and an Application to Relational Data (1998)
Sihem Amer-yahia, Sophie Cluet, Claude Delobel
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelOO whose targets are any ODBC...
Bulk Loading Techniques for Object Databases and an Application to Relational Data (1998)
Sihem Amer-yahia, Sophie Cluet
We present a framework for designing, in a declarative and flexible way, efficient migra-tion programs and an undergoing implemen-tation of a migration tool called RelOO whose targets are any ODBC...
From Relations to Objects - The RelOO Prototype (1997)
Relational database products have been used for many years. Object oriented systems provide advanced technology for complex applications but ther use is not so widespread compared with relational...