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

Cristian Duda

dblp:57/2740 · DBLP profile ↗
← Back
5ranked-venue papers
4as 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 · 5 · 4 first-author

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
Information retrieval · 81% Indexing and storage engines · 15% Web and social media mining · 4%

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

TopicWeightPapersLastEvidence papers
Information retrieval › search engines
desktop search
0.222010
Predicate-based indexing for desktop search · VLDB J. 2010
Bringing Precision to Desktop Search: A Predicate-based Desktop Search Architecture · ICDE 2007
Information retrieval
search engines
0.222009
AJAX Crawl: Making AJAX Applications Searchable · ICDE 2009
AJAXSearch: crawling, indexing and searching web 2.0 applications · Proc. VLDB Endow. 2008
Indexing and storage engines › query indexing
boolean expression indexing
0.112010
Predicate-based indexing for desktop search · VLDB J. 2010
Information retrieval › search engines
crawling
0.112009
AJAX Crawl: Making AJAX Applications Searchable · ICDE 2009
Information retrieval › search engines
web crawling and indexing
0.112008
AJAXSearch: crawling, indexing and searching web 2.0 applications · Proc. VLDB Endow. 2008
Information retrieval
ranking
0.012008
AJAXSearch: crawling, indexing and searching web 2.0 applications · Proc. VLDB Endow. 2008
Information retrieval › search engines
structured data search
0.012007
Bringing Precision to Desktop Search: A Predicate-based Desktop Search Architecture · ICDE 2007

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

implicit predicates · 0.1
YearPublicationVenuePosition
2010 Predicate-based indexing for desktop search
Cristian Duda, Donald Kossmann, Chong Zhou
VLDB J.1
2009 AJAX Crawl: Making AJAX Applications Searchable
abstract
Current search engines such as Google and Yahoo! are prevalent for searching the Web. Search on dynamic client-side Web pages is, however, either inexistent or far from perfect, and not addressed by existing work, for example on Deep Web. This is a real impediment since AJAX and Rich Internet Applications are already very common in the Web. AJAX applications are composed of states which can be seen by the user, but not by the search engine, and changed by the user using client-side events. Current search engines either ignore AJAX applications or produce false negatives. The reason is that crawling client-side code is a difficult problem that cannot be solved naively by invoking user events. The challenges are: lack of caching, duplicate states detection, very granular events, reducing the number of AJAX calls and infinite event invocation. This paper sets the stage for this new search challenge and proposes a solution: it shows how an AJAX Web application can be crawled in the granularity of the application states. A model of AJAX Web sites is presented. An AJAX Crawler and optimizations for caching and duplicate elimination are defined, and finally, the gain in search result quality and corresponding performance price are evaluated on YouTube, a real AJAX application.
Cristian Duda, Gianni Frey, Donald Kossmann, Reto Matter, Chong Zhou
ICDE1
2008 AJAXSearch: crawling, indexing and searching web 2.0 applications
abstract
Current search engines such as Google and Yahoo! are prevalent for searching the Web. Search in dynamic pages, however, is either inexistent or far from perfect. AJAX and Rich Internet Application are such applications. They are increasingly frequent on the Web (in YouTube, Amazon, GMail, Yahoo!Mail) or mobile devices and are offering a high degree of interactivity to the user, by seamlessly loading content from the server without the need to refresh the page. Current search engines cannot correctly index AJAX applications. This produces false positives and false negatives, because search engines do not understand the application logic that loads content dynamically. Crawling an AJAX application is a difficult problem. Since the user invokes events on the page, crawling must identify the different application states generated by the client-side logic. This demo sets the stage for this new type of search and shows that a search engine for AJAX can be built. Among others, the challenges, as opposed to traditional search engines, are: automatically identifying states by triggering events, efficiently crawling application states, avoiding the invocation of potentially very numerous events, scalability in the number of events, duplicate elimination of states, result presentation and aggregation, ranking. The demo presents the AJAX search engine: crawler, indexer and query processor, applied on a real application and showcases challenges and solutions.
Cristian Duda, Gianni Frey, Donald Kossmann, Chong Zhou
Proc. VLDB Endow.1
2007 Predicate-based Indexing of Enterprise Web Applications
Cristian Duda, David A. Graf, Donald Kossmann
CIDR1
2007 Bringing Precision to Desktop Search: A Predicate-based Desktop Search Architecture
abstract
Google and other products have revolutionized the way we search for information on the Internet, Intranet, and on our desktop. However, the current generation of search products does not exploit the structure and semantics of data, as defined by application programs (e.g., Word or Excel) that generate the data. This paper shows how search technology can be enhanced with implicit predicates, in order to take into account the structure and semantics defined by applications. Better search results are produced with tolerable performance overhead, while at the same time maintaining the simplicity of the keyword search interface.
Jens Dittrich, Cristian Duda, Bjorn Jarisch, Donald Kossmann, Marcos Antonio Vaz Salles
ICDE2