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

Gideon Schaller

dblp:51/6210 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Databases, data management, data science and information retrieval · 4

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
Data models and query languages · 46% Database system architecture and tuning · 24% Data mining · 15%

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

TopicWeightPapersLastEvidence papers
Data models and query languages › XML query languages
XQuery
0.112005
XQuery Implementation in a Relational Database System · VLDB 2005
Database system architecture and tuning
extensibility
0.012004
Hosting the .NET Runtime in Microsoft SQL Server · SIGMOD Conference 2004
Data mining › predictive modeling › classification › structured classification
hierarchical labeling
0.012004
ORDPATHs: Insert-Friendly XML Node Labels · SIGMOD Conference 2004
Data models and query languages
XML data management
0.012004
ORDPATHs: Insert-Friendly XML Node Labels · SIGMOD Conference 2004
Indexing and storage engines
XML indexing
0.012004
Indexing XML Data Stored in a Relational Database · VLDB 2004
Data models and query languages › XML data management
XML labeling scheme
0.012004
ORDPATHs: Insert-Friendly XML Node Labels · SIGMOD Conference 2004
Database system architecture and tuning
relational database system
0.022005
XQuery Implementation in a Relational Database System · VLDB 2005
Indexing XML Data Stored in a Relational Database · VLDB 2004

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

ORDPATH labeling · 0.0
YearPublicationVenuePosition
2005 XQuery Implementation in a Relational Database System
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michael Rys, Gideon Schaller, Dragan Tomic, Adrian Baras, Brandon Berg, Denis Churin, Eugene Kogan
VLDB5
2004 Hosting the .NET Runtime in Microsoft SQL Server
abstract
The integration of the .NET Common Language Runtime (CLR) inside the SQL Server DBMS enables database programmers to write business logic in the form of functions, stored procedures, triggers, data types, and aggregates using modern programming languages such as C#, Visual Basic, C++, COBOL, and J++. This paper presents three main aspects of this work. First, it describes the architecture of the integration of the CLR inside the SQL Server database process to provide a safe, scalable, secure, and efficient environment to run user code. Second, it describes our approach to defining and enforcing extensibility contracts to allow a tight integration of types, aggregates, functions, triggers, and procedures written in modern languages with the DBMS. Finally, it presents initial performance results showing the efficiency of user-defined types and functions relative to equivalent native DBMS features.
Alazel Acheson, Mason Bendixen, José A. Blakeley, Peter Carlin, Ebru Ersan, Xiaowei Jiang, Christian Kleinerman, Balaji Rathakrishnan, Gideon Schaller, Beysim Sezgin, Ramachandran Venkatesh
SIGMOD Conference10
2004 ORDPATHs: Insert-Friendly XML Node Labels
abstract
We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft® SQL Server™. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case---a schema simplifies the problem). An example of an ORDPATH value display format is "1.5.3.9.1". A compressed binary representation of ORDPATH provides document order by simple byte-by-byte comparison and ancestry relationship equally simply. In addition, the ORDPATH scheme supports insertion of new nodes at arbitrary positions in the XML tree, their ORDPATH values "careted in" between ORDPATHs of sibling nodes, without relabeling any old nodes.
Patrick E. O'Neil, Elizabeth J. O'Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, Nigel Westbury
SIGMOD Conference5
2004 Indexing XML Data Stored in a Relational Database
Shankar Pal, Istvan Cseri, Gideon Schaller, Oliver Seeliger, Leo Giakoumakis, Vasili Vasili Zolotov
VLDB3