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

Shailendra Mishra

dblp:61/1344 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Data stream processing › continuous query processing
streaming SQL
0.112008
Towards a streaming SQL standard · Proc. VLDB Endow. 2008

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

partial order semantics · 0.1batching operator · 0.1
YearPublicationVenuePosition
2024 Developer load balancing bug triage: Developed load balance
abstract
Abstract During the software development process, numerous bugs are reported daily in the software bug repositories. Bug triage assigned these bugs to the most relevant and expert developer for resolution. Moreover, assigning bugs to an incompetent or an over‐engaged developer causes repeated reassignment to other developers until it is resolved. This problem can be solved by devising a triage process that assigns bugs to not only expert developers but also to those who are either under‐engaged or reasonably engaged but are not over‐engaged in work. This paper has designed and implemented work engagement sensitive bug triage that resolves the issue of assigning bugs to developers considering their due work engagement, expertise as well as the current state of activity. For this purpose, a developer profile is built by using metrics to generate three types of scores: technical skill, work engagement and work experience. Metadata features like developer‐name, email, developer‐work‐experience in bug resolution, last and present‐work‐activity, timestamp, component and priority are used for it. A multi‐criteria‐based Henry–Garret technique is used to generate a single ranked list of developers from three ranked lists. The performance of the proposed approach is evaluated on four large OOS projects: Mozilla, Eclipse, Netbeans, and Open Office covering 895,439 bug reports accumulated for 33 years of development. The overall system accuracy of the proposed triage using all four datasets is 91.96 ± 0.05% which is 5.87% better than previously published work. The proposed method is achieved up to 90.30 ± 0.05 and 97.1 ± 0.05 MRR and accuracy of reassignment respectively that indicates how significantly it re‐assigns the bug to the relevant developers. The results demonstrate improvement in the accuracy of software‐bugs triaging as well as a reduction in the probability of bug‐tossing.
Asmita Yadav, Mohammed Baljon, Shailendra Mishra, Sharad Saxena, Sunil Kumar Sharma
Expert Syst. J. Knowl. Eng.3
2008 Towards a streaming SQL standard
abstract
This paper describes a unification of two different SQL extensions for streams and its associated semantics. We use the data models from Oracle and StreamBase as our examples. Oracle uses a time-based execution model while StreamBase uses a tuple-based execution model. Time-based execution provides a way to model simultaneity while tuple-based execution provides a way to react to primitive events as soon as they are seen by the system. The result is a new model that gives the user control over the granularity at which one can express simultaneity. Of course, it is possible to ignore simultaneity altogether. The proposed model captures ordering and simultaneity through partial orders on batches of tuples. The batching and the ordering are encapsulated in and can be modified by means of a powerful new operator that we call SPREAD. This paper describes the semantics of SPREAD and gives several examples of its use.
Namit Jain, Shailendra Mishra, Anand Srinivasan, Johannes Gehrke, Jennifer Widom, Hari Balakrishnan, Ugur Çetintemel, Mitch Cherniack, Richard Tibbetts, Stanley B. Zdonik
Proc. VLDB Endow.2